Phys. Rev. E 72, 016110 (2005) [5 pages]Number of attractors in random Boolean networksReceived 21 March 2005; published 14 July 2005 The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update functions. A connection is made between the terms occurring in the calculation and between the more graphic concepts of frozen, nonfrozen, and relevant nodes, and relevant components. Based on this understanding, a phenomenological argument is given that reproduces the dependence of the attractor numbers on system size. © 2005 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.72.016110
DOI:
10.1103/PhysRevE.72.016110
PACS:
89.75.Hc, 05.65.+b, 02.50.Cw
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.