Scaling in critical random Boolean networks

Details Scaling in critical random Boolean networks Scaling in critical random Boolean networks

2005-06-30

arxiv.org/abs/cond-mat/0506807v1

Phys. Rev. E 72, 046124(2005)

Physics

Condensed Matter

Statistical Mechanics

9 pages Revtex, 5 eps figures

Scientific paper

10.1103/PhysRevE.72.046124

We derive mostly analytically the scaling behavior of the number of nonfrozen and relevant nodes in critical Kauffman networks (with two inputs per node) in the thermodynamic limit. By defining and analyzing a stochastic process that determines the frozen core we can prove that the mean number of nonfrozen nodes scales with the network size N as N^{2/3}, with only N^{1/3} nonfrozen nodes having two nonfrozen inputs. We also show the probability distributions for the numbers of these nodes. Using a different stochastic process, we determine the scaling behavior of the number of relevant nodes. Their mean number increases for large N as N^{1/3}, and only a finite number of relevant nodes have two relevant inputs. It follows that all relevant components apart from a finite number are simple loops, and that the mean number and length of attractors increases faster than any power law with network size.

Affiliated with

Also associated with

No associations

Rating

Scaling in critical random Boolean networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scaling in critical random Boolean networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling in critical random Boolean networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234443