Autocatalysis in reaction networks

Beyond fitness: The information imparted in population states by selection throughout lifecycles

We approach the questions, what part of evolutionary change results from selection, and what is the adaptive information flow into a population undergoing selection, as a problem of quantifying the divergence of typical trajectories realized under selection from the expected dynamics of their counterparts under a null stochastic-process model representing the absence of selection. This approach starts with a formulation of adaptation in terms of information and from that identifies selection from the genetic parameters that generate information flow; it is the reverse of a historical approach that defines selection in terms of fitness, and then identifies adaptive characters as those amplified in relative frequency by fitness. Adaptive information is a relative entropy on distributions of histories computed directly from the generators of stochastic evolutionary population processes, which in large population limits can be approximated by its leading exponential dependence as a large-deviation function. We study a particular class of generators that represent the genetic dependence of explicit transitions around reproductive cycles in terms of stoichiometry, familiar from chemical reaction networks. Following Smith (2023), which showed that partitioning evolutionary events among genetically distinct realizations of lifecycles yields a more consistent causal analysis through the Price equation than the construction from units of selection and fitness, here we show that it likewise yields more complete evolutionary information measures.

Universal motifs and the diversity of autocatalytic systems

Autocatalysis is essential for the origin of life and chemical evolution. However, the lack of a unified framework so far prevents a systematic study of autocatalysis. Here, we derive, from basic principles, general stoichiometric conditions for catalysis and autocatalysis in chemical reaction networks. This allows for a classification of minimal autocatalytic motifs called cores. While all known autocatalytic systems indeed contain minimal motifs, the classification also reveals hitherto unidentified motifs. We further examine conditions for kinetic viability of such networks, which depends on the autocatalytic motifs they contain and is notably increased by internal catalytic cycles. Finally, we show how this framework extends the range of conceivable autocatalytic systems, by applying our stoichiometric and kinetic analysis to autocatalysis emerging from coupled compartments. The unified approach to autocatalysis presented in this work lays a foundation toward the building of a systems-level theory of chemical evolution.

Intermediates, catalysts, persistence, and boundary steady states

For dynamical systems arising from chemical reaction networks, persistence is the property that each species concentration remains positively bounded away from zero, as long as species concentrations were all positive in the beginning. We describe two graphical procedures for simplifying reaction networks without breaking known necessary or sufficient conditions for persistence, by iteratively removing so-called intermediates and catalysts from the network. The procedures are easy to apply and, in many cases, lead to highly simplified network structures, such as monomolecular networks. For specific classes of reaction networks, we show that these conditions for persistence are equivalent to one another. Furthermore, they can also be characterized by easily checkable strong connectivity properties of a related graph. In particular, this is the case for (conservative) monomolecular networks, as well as cascades of a large class of post-translational modification systems (of which the MAPK cascade and the n-site futile cycle are prominent examples). Since one of the aforementioned sufficient conditions for persistence precludes the existence of boundary steady states, our method also provides a graphical tool to check for that.