Abstract
We introduce a method to study random Boolean networks with asynchronous stochastic update. Each node in the state space network starts with equal occupation probability, which then evolves to a steady state. Attractors and the sizes of their basins are determined by the nodes left occupied at late times. As for synchronous update, the basin entropy grows with system size only for critical networks. We determine analytically the distribution for the number of attractors and basin sizes for networks with connectivity K=1 . These differ from the case of synchronous update for all K .
Submitted Version (Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.