Closing probabilities in the Kauffman model: an annealed computation
arXiv:cond-mat/9510137 · doi:10.1016/0167-2789(96)00060-7
Abstract
We define a probabilistic scheme to compute the distributions of periods, transients and weigths of attraction basins in Kauffman networks. These quantities are obtained in the framework of the annealed approximation, first introduced by Derrida and Pomeau. Numerical results are in good agreement with the computed values of the exponents of average periods, but show also some interesting features which can not be explained whithin the annealed approximation.
latex, 36 pages, figures added in uufiles format,error in epsffile name
References in corpus (2)
Cited by in corpus (23)
- Stability of the Kauffman Model
- Relevant elments, Magnetization and Dynamical Properties in Kauffman Networks: a Numerical Study
- Lyapunov Exponents in Random Boolean Networks
- The Modular Structure of Kauffman Networks
- Criticality in Random Threshold Networks: Annealed Approximation and Beyond
- Synchronization of Kauffman networks
- Generation of arbitrarily two-point correlated random networks
- Escaping from cycles through a glass transition
- Cyclic annealing as an iterated random map
- Stable Distributions in Stochastic Fragmentation
- Reversible Boolean Networks I: Distribution of Cycle Lengths
- Binary threshold networks as a natural null model for biological networks
- Emergence of geometric Turing patterns in complex networks
- Dynamical Instability in Boolean Networks as a Percolation Problem
- Measuring Mutual Information in Random Boolean Networks
- Finite size corrections to random Boolean networks
- Rugged Fitness Landscapes of Kauffman Model with a Scale-Free Network
- Attractor and Basin Entropies of Random Boolean Networks Under Asynchronous Stochastic Update
- The computational complexity of Kauffman nets and the P versus NP problem
- Random sampling vs. exact enumeration of attractors in random Boolean networks
- Propagation of external regulation and asynchronous dynamics in random Boolean networks
- Avalanches, branching ratios, and clustering of attractors in Random Boolean Networks and in the segment polarity network of \emph{Drosophila}
- Fixed-points in Random Boolean Networks: The impact of parallelism in the scale-free topology case