Shreim Amer, Berdahl Andrew, Greil Florian, Davidsen Jörn, Paczuski Maya
Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, Alberta, Canada T2N 1N4.
Phys Rev E Stat Nonlin Soft Matter Phys. 2010 Sep;82(3 Pt 2):035102. doi: 10.1103/PhysRevE.82.035102. Epub 2010 Sep 16.
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 .
我们介绍一种研究具有异步随机更新的随机布尔网络的方法。状态空间网络中的每个节点初始时具有相等的占据概率，然后演化至稳态。吸引子及其吸引域的大小由后期仍处于占据状态的节点决定。至于同步更新，仅对于临界网络，吸引域熵随系统规模增长。我们通过解析确定了连通性K = 1的网络的吸引子数量和吸引域大小的分布。这些与所有K值下的同步更新情况不同。
