Core percolation and onset of complexity in Boolean networks
Disordered Systems and Neural Networks
2009-11-10 v3 Other Condensed Matter
Molecular Networks
Other Quantitative Biology
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.
Cite
@article{arxiv.cond-mat/0412443,
title = {Core percolation and onset of complexity in Boolean networks},
author = {L. Correale and M. Leone and A. Pagnani and M. Weigt and R. Zecchina},
journal= {arXiv preprint arXiv:cond-mat/0412443},
year = {2009}
}
Comments
major revisions, extended results, version accepted for publication in PRL