Criticality in random threshold networks: annealed approximation and beyond

DOI10.1016/S0378-4371(02)00798-7zbMath0995.82035arXivcond-mat/0201079OpenAlexW3102698487MaRDI QIDQ1600249

Thimo Rohlf, Stefan Bornholdt

Publication date: 12 June 2002

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

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

zbMATH Keywords

percolation transitionhighly connected nodesstatistical damage spreading distributions

Mathematics Subject Classification ID

Percolation (82B43)

Related Items (8)

Morphogenesis by coupled regulatory networks: reliable control of positional information and proportion regulation ⋮ Stationary ensembles in threshold networks ⋮ Real-Time Computation at the Edge of Chaos in Recurrent Neural Networks ⋮ Biologically meaningful update rules increase the critical connectivity of generalized Kauffman networks ⋮ Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks ⋮ Chaotic gene regulatory networks can be robust against mutations and noise ⋮ Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation ⋮ EMERGENT NETWORK STRUCTURE, EVOLVABLE ROBUSTNESS, AND NONLINEAR EFFECTS OF POINT MUTATIONS IN AN ARTIFICIAL GENOME MODEL

Cites Work

• Closing probabilities in the Kauffman model: An annealed computation
• Phase transitions and antichaos in generalized Kauffman networks
• Emergence of Scaling in Random Networks
• Exploring complex networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Criticality in random threshold networks: annealed approximation and beyond