Finite size corrections to random Boolean networks

作     者：Leone, Michele Pagnani, Andrea Parisi, Giorgio Zagordi, Osvaldo 

作者机构：ISI Fdn I-10133 Turin Italy Univ Roma La Sapienza Dipartimento Fis I-00185 Rome Italy Scuola Int Super Studi Avanzati ISAS I-34014 Trieste Italy 

出 版 物：《JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT》 (统计力学杂志：理论和实验)

年 卷 期：2006年第2006卷第12期

页      面：P12012-P12012页

核心收录：

学科分类：07[理学] 070201[理学-理论物理] 0702[理学-物理学] 0801[工学-力学（可授工学、理学学位）] 

主　　题：message-passing algorithms random graphs networks 

摘      要：Since 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.