Michele Leone et al J. Stat. Mech. (2006) P12012 doi:10.1088/1742-5468/2006/12/P12012
Michele Leone1, Andrea Pagnani1, Giorgio Parisi2 and Osvaldo Zagordi3
Show affiliationsSince their introduction, Boolean networks have been traditionally studied in view of their rich dynamical behaviour under different update protocols and for their qualitative analogy with cell regulatory networks. More recently, tools borrowed from the statistical physics of disordered systems and from computer science have provided a more complete characterization of their equilibrium behaviour. However, the largest number of results have been obtained in the thermodynamic limit, which is often far from being reached when dealing with realistic instances of the problem. The numerical analysis presented here aims at comparing—for a specific family of models—the outcomes given by the heuristic belief propagation algorithm with those given by exhaustive enumeration. In the second part of the paper some analytical considerations on the validity of the annealed approximation are discussed.
05.70.Ce Thermodynamic functions and equations of state
05.40.-a Fluctuation phenomena, random processes, noise, and Brownian motion
02.30.-f Function theory, analysis
82C35 Irreversible thermodynamics, including Onsager-Machlup theory
Issue 12 (December 2006)
Received 31 October 2006, accepted for publication 27 November 2006
Published 18 December 2006
Michele Leone et al J. Stat. Mech. (2006) P12012
Ram Brustein and Amos Yarom J. Stat. Mech. (2008) P07025
E Ben-Naim et al J. Stat. Mech. (2006) P07001
Miquel Montero J. Stat. Mech. (2007) P04002
John Ardelius et al J. Stat. Mech. (2007) P10012
Iwan Jensen J. Stat. Mech. (2004) P10008
R-D Herzberg et al 2006 Phys. Scr. 2006 73
Joachim Krug J. Stat. Mech. (2007) P07001
J C Woicik et al 2005 Phys. Scr. 2005 620
Miloslav Znojil 2008 J. Phys. A: Math. Theor. 41 215304