Core percolation and onset of complexity in boolean networks.
The determination and classification of fixed points of large Boolean networks is addressed in terms of a 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 transition line from an easy to a complex regulatory phase is described as a function of the parameters of the model, identifying thereby both theoretically and algorithmically the relevant regulatory variables.
Correale
L
L
Politecnico di Torino, Corso Duca degli Abruzzi 24, I-10129 Torino, Italy.
Leone
M
M
Pagnani
A
A
Weigt
M
M
Zecchina
R
R
D000465:Algorithms; D005786:Gene Expression Regulation; D008957:Models, Genetic