Formation of the frozen core in critical Boolean Networks

Abstract

We investigate numerically and analytically the formation of the frozen core in critical random Boolean networks with biased functions. We demonstrate that a previously used efficient algorithm for obtaining the frozen core, which starts from the nodes with constant functions, fails when the number of inputs per node exceeds 4. We present computer simulation data for the process of formation of the frozen core and its robustness, and we show that several important features of the data can be derived by using a mean-field calculation.

References in corpus (9)

• Random Boolean Network Models and the Yeast Transcriptional Network
• Scaling in ordered and critical random Boolean networks
• Relevant elments, Magnetization and Dynamical Properties in Kauffman Networks: a Numerical Study
• The Modular Structure of Kauffman Networks
• Scaling in critical random Boolean networks
• Scaling in a general class of critical random Boolean networks
• Exhaustive percolation on random networks
• The properties of attractors of canalyzing random Boolean networks
• Critical Boolean networks with scale-free in-degree distribution

Cited by in corpus (2)

• Symmetry in Critical Random Boolean Network Dynamics
• Scaling laws in critical random Boolean networks with general in- and out-degree distributions