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 the 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.
Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem / A., Seganti; A., De Martino; RICCI TERSENGHI, Federico. - In: PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS. - ISSN 1539-3755. - 89:2(2014), p. 022139. [10.1103/physreve.89.022139]
Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem
RICCI TERSENGHI, Federico
2014
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 the 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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.