Boolean constraint satisfaction problems for reaction networks

DOI10.1088/1742-5468/2013/09/P09009zbMATH Open1456.82791arXiv1306.2480MaRDI QIDQ3301686FDOQ3301686

Author name not available (Why is that?)

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: We define and study a class of (random) Boolean constraint satisfaction problems representing minimal feasibility constraints for networks of chemical reactions. The constraints we consider encode, respectively, for hard mass-balance conditions (where the consumption and production fluxes of each chemical species are matched) and for soft mass-balance conditions (where a net production of compounds is in principle allowed). We solve these constraint satisfaction problems under the Bethe approximation and derive the corresponding Belief Propagation equations, that involve 8 different messages. The statistical properties of ensembles of random problems are studied via the population dynamics methods. By varying a chemical potential attached to the activity of reactions, we find first order transitions and strong hysteresis, suggesting a non-trivial structure in the space of feasible solutions.

Full work available at URL: https://arxiv.org/abs/1306.2480

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Population dynamics (general) (92D25) Combinatorial probability (60C05) Stochastic methods (Fokker-Planck, Langevin, etc.) applied to problems in time-dependent statistical mechanics (82C31)

Cites Work

• Title not available (Why is that?)
• Two solutions to diluted \(p\)-spin models and XORSAT problems
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The cavity method at zero temperature
• Propagation of external regulation and asynchronous dynamics in random Boolean networks
• Typical properties of optimal growth in the Von Neumann expanding model for large random economies
• Von Neumann’s expanding model on random graphs

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Boolean constraint satisfaction problems for reaction networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301686)