Closing probabilities in the Kauffman model: An annealed computation

DOI10.1016/0167-2789(96)00060-7zbMath0884.68091arXivcond-mat/9510137OpenAlexW2044873481WikidataQ58042960 ScholiaQ58042960MaRDI QIDQ1814682

U. Bastolla, Giorgio Parisi

Publication date: 30 October 1996

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9510137

zbMATH Keywords

Kauffman networks

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)

Related Items (12)

Percolation in bipartite Boolean networks and its role in sustaining life ⋮ A proposal for using the ensemble approach to understand genetic regulatory networks ⋮ Relevant elements, magnetization and dynamical properties in Kauffman networks: A numerical study ⋮ The modular structure of Kauffman networks ⋮ Boolean dynamics of Kauffman models with a scale-free network ⋮ Biologically meaningful update rules increase the critical connectivity of generalized Kauffman networks ⋮ Stochastic coupling of two random Boolean networks ⋮ SYNCHRONIZATION OF COUPLED EXTENDED DYNAMICAL SYSTEMS: A SHORT REVIEW ⋮ Using the renormalization group to classify Boolean functions ⋮ Random Boolean networks response to external periodic signals ⋮ SIMPLIFYING BOOLEAN NETWORKS ⋮ Criticality in random threshold networks: annealed approximation and beyond

Cites Work

• Unnamed Item
• Relevant elements, magnetization and dynamical properties in Kauffman networks: A numerical study
• The modular structure of Kauffman networks
• Exact solution of Kauffman's model with connectivity one
• An order parameter for networks of automata
• Probability Distributions Related to Random Mappings

This page was built for publication: Closing probabilities in the Kauffman model: An annealed computation