Scaling in ordered and critical random Boolean networks

Details Scaling in ordered and critical random Boolean networks Scaling in ordered and critical random Boolean networks

2002-12-12

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

Physics

Condensed Matter

Disordered Systems and Neural Networks

4 pages, 3 figures; (Re)submitted to Physical Review Letters

Scientific paper

10.1103/PhysRevLett.90.068702

Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks lie at or near a critical point in parameter space that divides ``ordered'' from ``chaotic'' attractor dynamics. In the ordered regime, we show rigorously that the average number of relevant nodes (the ones that determine the attractor dynamics) remains constant with increasing system size N. For critical networks, our analysis and numerical results show that the number of relevant nodes scales like N^{1/3}. Numerical experiments also show that the median number of attractors in critical networks grows faster than linearly with N. The calculations explain why the correct asymptotic scaling is observed only for very large N.

Affiliated with

Also associated with

No associations

Rating

Scaling in ordered and 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 ordered and critical random Boolean networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling in ordered and critical random Boolean networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-344384