SearcharxivSearch

arXiv · 2502.11692

An introduction to random rule-based chemical networks

Abstract

Large chemical networks appear in various branches of chemistry and biology, in particular, cellular metabolism and prebiotic chemistry. Detailed simulations of such networks are difficult, or even impossible for lack of kinetic data. Various strategies have been developed to produce synthetic random networks mimicking the large scale organizational properties of experimental chemical networks. These random networks are however mathematical artefacts, which fail to reflect the general reactivity structure of chemistry. We present here a new class of random models of prebiotic (uncatalyzed) chemistry, based on context-independent rules, which is coherent with the general compositional logic of metabolism. The general organization of the random networks fits within the small world paradigm. We get a phase diagram of the models through an approximate mapping to a solvable tree growth model. Our predictions go beyond a purely abstract connectivity analysis of the reaction graph by studying the diversity of chemical mechanisms, and singling out evolutionary patterns, such as autocatalysis and multistationarity, paving the road to possible open-ended evolution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeremie Unterberger. 2025-02-17. An introduction to random rule-based chemical networks. https://arxiv.org/abs/2502.11692

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR