Von Neumann's expanding model on random graphs

DOI10.1088/1742-5468/2007/05/P05012MaRDI QIDQ5239358zbMATH OpenOpenAlexFDO

Authors Andrea De Martino, Carlotta Martelli, Isaac Pérez Castillo, R. Monasson

Publication date 22 October 2019

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

Full work available at URL https://arxiv.org/abs/cond-mat/0703343

zbMATH Keywords

cavity and replica methoddisordered systems (theory)molecular networks (theory)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)

Abstract: Within the framework of Von Neumann's expanding model, we study the maximum growth rate r achievable by an autocatalytic reaction network in which reactions involve a finite (fixed or fluctuating) number D of reagents. r is calculated numerically using a variant of the Minover algorithm, and analytically via the cavity method for disordered systems. As the ratio between the number of reactions and that of reagents increases the system passes from a contracting (r<1) to an expanding regime (r>1). These results extend the scenario derived in the fully connected model ($Doinfinity$), with the important difference that, generically, larger growth rates are achievable in the expanding phase for finite D and in more diluted networks. Moreover, the range of attainable values of r shrinks as the connectivity increases.

Recommendations

• Typical properties of optimal growth in the von Neumann expanding model for large random economies
• Random catalytic reaction networks
• Rate equation appraoch for growing networks
• Autocatalytic networks with intermediates. I: Irreversible reactions
• Small autocatalytic reaction networks. III: Monotone growth functions

Cites work

• scientific article; zbMATH DE number 4081254 (Why is no real title available?)
• Linear Inequalities and Related Systems. (AM-38)
• Typical properties of optimal growth in the von Neumann expanding model for large random economies

Cited in

(2)

• A weighted belief-propagation algorithm for estimating volume-related properties of random polytopes
• Boolean constraint satisfaction problems for reaction networks

This page was built for publication: Von Neumann's expanding model on random graphs

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