Core percolation and onset of complexity in Boolean networks
arXiv:cond-mat/0412443 · doi:10.1103/PhysRevLett.96.018101
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.
major revisions, extended results, version accepted for publication in PRL
References in corpus (3)
Cited by in corpus (17)
- Controllability of multiplex, multi-timescale networks
- Boolean Delay Equations: A simple way of looking at complex systems
- On the basic computational structure of gene regulatory networks
- Controllability and maximum matchings of complex networks
- Computational core and fixed-point organisation in Boolean networks
- Finite size corrections to random Boolean networks
- Two faces of greedy leaf removal procedure on graphs
- Satisfiability, sequence niches, and molecular codes in cellular signaling
- Propagation of external regulation and asynchronous dynamics in random Boolean networks
- Phase transitions and memory effects in the dynamics of Boolean networks
- Circuits, Attractors and Reachability in Mixed-K Kauffman Networks
- Feedback topology and XOR-dynamics in Boolean networks with varying input structure
- Boolean constraint satisfaction problems for reaction networks
- A local algorithm and its percolation analysis of bipartite -matching problem
- Simplifying Random Satisfiability Problem by Removing Frustrating Interactions
- Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem
- A numerical investigation of the jamming transition in traffic flow on diluted planar networks