Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem
arXiv:1310.5637 · doi:10.1103/PhysRevE.89.022139
Abstract
We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reaction networks. First, we show that the CSPs generalize the scheme known as Network Expansion, which is recovered in a specific limit. Next, a full statistical mechanics characterization (including the phase diagram and a discussion of physical origin of the phase transitions) for Network Expansion is obtained. Finally, we provide a message-passing algorithm to solve the original CSPs in the most general form.
arXiv comment13 pages (incl. appendix)
References in corpus (6)
- Motifs emerge from function in model gene regulatory networks
- On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms
- Pseudolikelihood Decimation Algorithm Improving the Inference of the Interaction Network in a General Class of Ising Models
- Core percolation and onset of complexity in Boolean networks
- Computational core and fixed-point organisation in Boolean networks
- Boolean constraint satisfaction problems for reaction networks