Abstract (may include machine translation)
The dynamics of noise-resilient Boolean networks with majority functions and diverse topologies is investigated. A wide class of possible topological configurations is parametrized as a stochastic blockmodel. For this class of networks, the dynamics always undergoes a phase transition from a non-ergodic regime, where a memory of its past states is preserved, to an ergodic regime, where no such memory exists and every microstate is equally probable. Both the average error on the network and the critical value of noise where the transition occurs are investigated analytically, and compared to numerical simulations. The results for 'partially dense' networks, comprising relatively few, but dynamically important nodes, which have a number of inputs that greatly exceeds the average for the entire network, give very general upper bounds on the maximum resilience against noise attainable on globally sparse systems.
Original language | English |
---|---|
Article number | P01006 |
Journal | Journal of Statistical Mechanics: Theory and Experiment |
Volume | 2012 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2012 |
Externally published | Yes |
Keywords
- classical phase transitions (theory)
- error correcting codes
- network dynamics
- networks
- random graphs