arXiv Analytics

Sign in

arXiv:1106.4948 [cond-mat.dis-nn]AbstractReferencesReviewsResources

Phase transitions and memory effects in the dynamics of Boolean networks

Alexander Mozeika, David Saad

Published 2011-06-24Version 1

The generating functional method is employed to investigate the synchronous dynamics of Boolean networks, providing an exact result for the system dynamics via a set of macroscopic order parameters. The topology of the networks studied and its constituent Boolean functions represent the system's quenched disorder and are sampled from a given distribution. The framework accommodates a variety of topologies and Boolean function distributions and can be used to study both the noisy and noiseless regimes; it enables one to calculate correlation functions at different times that are inaccessible via commonly used approximations. It is also used to determine conditions for the annealed approximation to be valid, explore phases of the system under different levels of noise and obtain results for models with strong memory effects, where existing approximations break down. Links between BN and general Boolean formulas are identified and common results to both system types are highlighted.

Related articles: Most relevant | Search more
arXiv:cond-mat/0411102 (Published 2004-11-04, updated 2005-01-07)
Stable and unstable attractors in Boolean networks
arXiv:2501.03981 [cond-mat.dis-nn] (Published 2025-01-07)
Supervised and unsupervised learning the many-body critical phase, phase transitions and critical exponents in disordered quantum systems
arXiv:2308.15532 [cond-mat.dis-nn] (Published 2023-08-29)
Information Bounds on phase transitions in disordered systems