title: Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem.
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.
authors.affiliation: Dipartimento di Fisica, Sapienza Università di Roma, p.le A. Moro 2, 00185 Rome, Italy.
authors.forename: A
authors.initials: A
authors.lastname: Seganti
authors.affiliation: Dipartimento di Fisica, Sapienza Università di Roma, p.le A. Moro 2, 00185 Rome, Italy and IPCF-CNR, UOS di Roma, Dipartimento di Fisica, Sapienza Università di Roma, Rome, Italy and Center for Life Nano Science@Sapienza, Istituto Italiano di Tecnologia, Viale Regina Elena 291, 00161 Rome, Italy.
authors.forename: A
authors.initials: A
authors.lastname: De Martino
authors.affiliation: Dipartimento di Fisica, Sapienza Università di Roma, p.le A. Moro 2, 00185 Rome, Italy and IPCF-CNR, UOS di Roma, Dipartimento di Fisica, Sapienza Università di Roma, Rome, Italy and INFN, Sezione di Roma 1, Dipartimento di Fisica, Sapienza Università di Roma, Rome, Italy.
authors.forename: F
authors.initials: F
authors.lastname: Ricci-Tersenghi
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D005240:Feasibility Studies; D008956:Models, Chemical; D015233:Models, Statistical