arXiv · cond-mat/0412443
Core percolation and onset of complexity in Boolean networks
Abstract
The determination and classification of fixed points of large Boolean networks is addressed in terms of constraint satisfaction problem. We develop a general simplification scheme that, removing all those variables and functions belonging to trivial logical cascades, returns the computational core of the network. The onset of an easy-to-complex regulatory phase is introduced as a function of the parameters of the model, identifying both theoretically and algorithmically the relevant regulatory variables.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
L. Correale, M. Leone, A. Pagnani, M. Weigt, R. Zecchina. 2005-11-22. Core percolation and onset of complexity in Boolean networks. https://doi.org/10.1103/physrevlett.96.018101
Cite the original work for its findings. Save a collection to share your selection of sources.