Attractor and basin entropies of random Boolean networks under asynchronous stochastic update

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 .