SearcharxivSearch

arXiv subjects

Wim Hordijk

Publications and source records attributed to Wim Hordijk.

At least 19 recordsLinked to original sources

Bridging two theoretical frameworks of autocatalysis: RAF sets and stoichiometric autocatalysis

Autocatalysis lies at the heart of many (bio)chemical processes and is key to processes leading up to the origin of life. Two seemingly very different formalisms have emerged that define autocatalysis. Kauffman introduced collective autocatalysis to describe systems of molecules that mutually catalyze each other's formation, emphasizing the self-sustaining character of autocatalytic systems. This view is mathematically formalized in the theory of Reflexively Autocatalytic and Food-generated sets (RAF). In parallel, stoichiometric autocatalysis emerged from the theory of Chemical Reaction Networks (CRN), focusing on the net-productive, self-amplifying character of autocatalytic subnetworks. These two frameworks have coexisted independently in the literature, since RAF theory considers each reaction as explicitly catalyzed, while the CRN approach often excludes explicitly catalyzed reactions altogether. Nevertheless, both frameworks describe reaction networks and thus admit a common mathematical representation in terms of stoichiometric matrices. We highlight this connection and show that the two formalisms are less disparate than they might appear. To illustrate this point we prove that, under mild and general conditions, any RAF is stoichiometrically autocatalytic.

q-bio.MN

A Concise and Formal Definition of RAF Sets and the RAF Algorithm

Autocatalytic sets are self-catalyzing and self-sustaining chemical reaction networks that are believed to have played an important role in the origin of life. They have been studied extensively both theoretically as well as experimentally. This short note provides (1) a complete and formal definition of autocatalytic sets (or RAF sets), and (2) an efficient algorithm to detect such sets in arbitrary reaction networks. Although both have been presented in various forms in earlier publications, this note serves as a concise and convenient reference.

q-bio.MN

Emergence of Autocatalytic Sets in a Simple Model of Technological Evolution

Two alternative views of an economy are combined and studied. The first view is that of technological evolution as a process of combinatorial innovation. Recently a simple mathematical model (TAP) was introduced to study such a combinatorial process. The second view is that of a network of production functions forming an autocatalytic set. Autocatalytic (RAF) sets have been studied extensively in the context of chemical reaction networks. Here, we combine the two models (TAP and RAF) and show that they are compatible. In particular, it is shown that production function networks resulting from the combinatorial TAP model have a high probability of containing autocatalytic (RAF) sets. We also study the size distribution and robustness of such "economic autocatalytic sets", and compare our results with those from the chemical context. These initial results strongly support earlier claims that the economy can indeed be seen as an autocatalytic set.

q-bio.MN

Snooker Statistics and Zipf's Law

Zipf's law is well known in linguistics: the frequency of a word is inversely proportional to its rank. This is a special case of a more general power law, a common phenomenon in many kinds of real-world statistical data. Here, it is shown that snooker statistics also follow such a mathematical pattern, but with varying (estimated) parameter values. Two types of rankings (prize money earned and centuries scored), and three time-frames (all-time, decade, and year) are considered. The results indicate that the power law parameter values depend on the type of ranking used as well as the time-frame considered. Furthermore, in some cases the resulting parameter values vary significantly over time, for which a plausible explanation is provided.

physics.soc-ph

Dynamics of a birth-death process based on combinatorial innovation

A feature of human creativity is the ability to take a subset of existing items (e.g. objects, ideas, or techniques) and combine them in various ways to give rise to new items, which, in turn, fuel further growth. Occasionally, some of these items may also disappear (extinction). We model this process by a simple stochastic birth--death model, with non-linear combinatorial terms in the growth coefficients to capture the propensity of subsets of items to give rise to new items. In its simplest form, this model involves just two parameters $(P, α)$. This process exhibits a characteristic 'hockey-stick' behaviour: a long period of relatively little growth followed by a relatively sudden 'explosive' increase. We provide exact expressions for the mean and variance of this time to explosion and compare the results with simulations. We then generalise our results to allow for more general parameter assignments, and consider possible applications to data involving human productivity and creativity.

q-bio.PE

Tractable models of self-sustaining autocatalytic networks

Self-sustaining autocatalytic networks play a central role in living systems, from metabolism at the origin of life, simple RNA networks, and the modern cell, to ecology and cognition. A collectively autocatalytic network that can be sustained from an ambient food set is also referred to more formally as a `Reflexively Autocatalytic F-generated' (RAF) set. In this paper, we first investigate a simplified setting for studying RAFs, which are nevertheless relevant to real biochemistry and allows for a more exact mathematical analysis based on graph-theoretic concepts. This, in turn, allows for the development of efficient (polynomial-time) algorithms for questions that are computationally NP-hard in the general RAF setting. We then show how this simplified setting for RAF systems leads naturally to a more general notion of RAFs that are `generative' (they can be built up from simpler RAFs) and for which efficient algorithms carry over to this more general setting. Finally, we show how classical RAF theory can be extended to deal with ensembles of catalysts as well as the assignment of rates to reactions according to which catalysts (or combinations of catalysts) are available.

q-bio.MN

Autocatalytic Sets and RNA Secondary Structure

The dominant paradigm in origin of life research is that of an RNA world. However, despite experimental progress towards the spontaneous formation of RNA, the RNA world hypothesis still has its problems. Here, we introduce a novel computational model of chemical reaction networks based on RNA secondary structure and analyze the existence of autocatalytic sub-networks in random instances of this model, by combining two well-established computational tools. Our main results are that (i) autocatalytic sets are highly likely to exist, even for very small reaction networks and short RNA sequences, and (ii) sequence diversity seems to be a more important factor in the formation of autocatalytic sets than sequence length. These findings could shed new light on the probability of the spontaneous emergence of an RNA world as a network of mutually collaborative ribozymes.

q-bio.MN

Autocatalytic sets in polymer networks with variable catalysis distributions

All living systems -- from the origin of life to modern cells -- rely on a set of biochemical reactions that are simultaneously self-sustaining and autocatalytic. This notion of an autocatalytic set has been formalized graph-theoretically (as `RAF'), leading to mathematical results and polynomial-time algorithms that have been applied to simulated and real chemical reaction systems. In this paper, we investigate the emergence of autocatalytic sets in polymer models when the catalysis rate of each molecule type is drawn from some probability distribution. We show that although the average catalysis rate $f$ for RAFs to arise depends on this distribution, a universal linear upper and lower bound for $f$ (with increasing system size) still applies. However, the probability of the appearance (and size) of autocatalytic sets can vary widely, depending on the particular catalysis distribution. We use simulations to explore how tight the mathematical bounds are, and the reasons for the observed variations. We also investigate the impact of inhibition (where molecules can also inhibit reactions) on the emergence of autocatalytic sets, deriving new mathematical and algorithmic results.

q-bio.MN

On RAF Sets and Autocatalytic Cycles in Random Reaction Networks

The emergence of autocatalytic sets of molecules seems to have played an important role in the origin of life context. Although the possibility to reproduce this emergence in laboratory has received considerable attention, this is still far from being achieved. In order to unravel some key properties enabling the emergence of structures potentially able to sustain their own existence and growth, in this work we investigate the probability to observe them in ensembles of random catalytic reaction networks characterized by different structural properties. From the point of view of network topology, an autocatalytic set have been defined either in term of strongly connected components (SCCs) or as reflexively autocatalytic and food-generated sets (RAFs). We observe that the average level of catalysis differently affects the probability to observe a SCC or a RAF, highlighting the existence of a region where the former can be observed, whereas the latter cannot. This parameter also affects the composition of the RAF, which can be further characterized into linear structures, autocatalysis or SCCs. Interestingly, we show that the different network topology (uniform as opposed to power-law catalysis systems) does not have a significantly divergent impact on SCCs and RAFs appearance, whereas the proportion between cleavages and condensations seems instead to play a role. A major factor that limits the probability of RAF appearance and that may explain some of the difficulties encountered in laboratory seems to be the presence of molecules which can accumulate without being substrate or catalyst of any reaction.

nlin.AO

Autocatalytic sets in a partitioned biochemical network

In previous work, RAF theory has been developed as a tool for making theoretical progress on the origin of life question, providing insight into the structure and occurrence of self-sustaining and collectively autocatalytic sets within catalytic polymer networks. We present here an extension in which there are two "independent" polymer sets, where catalysis occurs within and between the sets, but there are no reactions combining polymers from both sets. Such an extension reflects the interaction between nucleic acids and peptides observed in modern cells and proposed forms of early life.

q-bio.MN

Autocatalytic Sets and Biological Specificity

A universal feature of the biochemistry of any living system is that all the molecules and catalysts that are required for reactions of the system can be built up from an available food source by repeated application of reactions from within that system. RAF (reflexively autocatalytic and food-generated) theory provides a formal way to study such processes. Beginning with Kauffman's notion of "collectively autocatalytic sets", this theory has been further developed over the last decade with the discovery of efficient algorithms and new mathematical analysis. In this paper, we study how the behaviour of a simple binary polymer model can be extended to models where the pattern of catalysis more precisely reflects the ligation and cleavage reactions involved. We find that certain properties of these models are similar to, and can be accurately predicted from, the simple binary polymer model; however, other properties lead to slightly different estimates. We also establish a number of new results concerning the structure of RAFs in these systems.

q-bio.MN

Minimal autocatalytic networks

Self-sustaining autocatalytic chemical networks represent a necessary, though not sufficient condition for the emergence of early living systems. These networks have been formalised and investigated within the framework of RAF theory, which has led to a number of insights and results concerning the likelihood of such networks forming. In this paper, we extend this analysis by focussing on how {\em small} autocatalytic networks are likely to be when they first emerge. First we show that simulations are unlikely to settle this question, by establishing that the problem of finding a smallest RAF within a catalytic reaction system is NP-hard. However, irreducible RAFs (irrRAFs) can be constructed in polynomial time, and we show it is possible to determine in polynomial time whether a bounded size set of these irrRAFs contain the smallest RAFs within a system. Moreover, we derive rigorous bounds on the sizes of small RAFs and use simulations to sample irrRAFs under the binary polymer model. We then apply mathematical arguments to prove a new result suggested by those simulations: at the transition catalysis level at which RAFs first form in this model, small RAFs are unlikely to be present. We also investigate further the relationship between RAFs and another formal approach to self-sustaining and closed chemical networks, namely chemical organisation theory (COT).

q-bio.MN

A formal model of autocatalytic sets emerging in an RNA replicator system

Background: The idea that autocatalytic sets played an important role in the origin of life is not new. However, the likelihood of autocatalytic sets emerging spontaneously has long been debated. Recently, progress has been made along two different lines. Experimental results have shown that autocatalytic sets can indeed emerge in real chemical systems, and theoretical work has shown that the existence of such self-sustaining sets is highly likely in formal models of chemical systems. Here, we take a first step towards merging these two lines of work by constructing and investigating a formal model of a real chemical system of RNA replicators exhibiting autocatalytic sets. Results: We show that the formal model accurately reproduces recent experimental results on an RNA replicator system, in particular how the system goes through a sequence of larger and larger autocatalytic sets, and how a cooperative (autocatalytic) system can outcompete an equivalent selfish system. Moreover, the model provides additional insights that could not be obtained from experiments alone, and it suggests several experimentally testable hypotheses. Conclusions: Given these additional insights and predictions, the modeling framework provides a better and more detailed understanding of the nature of chemical systems in general and the emergence of autocatalytic sets in particular. This provides an important first step in combining experimental and theoretical work on autocatalytic sets in the context of the orgin of life.

q-bio.MN

Autocatalytic Sets Extended: Dynamics, Inhibition, and a Generalization

Background: Autocatalytic sets are often considered a necessary (but not sufficient) condition for the origin and early evolution of life. Although the idea of autocatalytic sets was already conceived of many years ago, only recently have they gained more interest, following advances in creating them experimentally in the laboratory. In our own work, we have studied autocatalytic sets extensively from a computational and theoretical point of view. Results: We present results from an initial study of the dynamics of self-sustaining autocatalytic sets (RAFs). In particular, simulations of molecular flow on autocatalytic sets are performed, to illustrate the kinds of dynamics that can occur. Next, we present an extension of our (previously introduced) algorithm for finding autocatalytic sets in general reaction networks, which can also handle inhibition. We show that in this case detecting autocatalytic sets is fixed parameter tractable. Finally, we formulate a generalized version of the algorithm that can also be applied outside the context of chemistry and origin of life, which we illustrate with a toy example from economics. Conclusions: Having shown theoretically (in previous work) that autocatalytic sets are highly likely to exist, we conclude here that also in terms of dynamics such sets are viable and outcompete non-autocatalytic sets. Furthermore, our dynamical results confirm arguments made earlier about how autocatalytic subsets can enable their own growth or give rise to other such subsets coming into existence. Finally, our algorithmic extension and generalization show that more realistic scenarios (e.g., including inhibition) can also be dealt with within our framework, and that it can even be applied to areas outside of chemistry, such as economics.

q-bio.MN

The Structure of Autocatalytic Sets: Evolvability, Enablement, and Emergence

This paper presents new results from a detailed study of the structure of autocatalytic sets. We show how autocatalytic sets can be decomposed into smaller autocatalytic subsets, and how these subsets can be identified and classified. We then argue how this has important consequences for the evolvability, enablement, and emergence of autocatalytic sets. We end with some speculation on how all this might lead to a generalized theory of autocatalytic sets, which could possibly be applied to entire ecologies or even economies.

q-bio.MN

Predicting template-based catalysis rates in a simple catalytic reaction model

We show that in a particular model of catalytic reaction systems, known as the binary polymer model, there is a mathematical invariance between two versions of the model: (1) random catalysis and (2) template-based catalysis. In particular, we derive an analytical calculation that allows us to accurately predict the (observed) required level of catalysis in one version of the model from that in the other version, for a given probability of having self-sustaining autocatalytic sets exist in instances of both model versions. This provides a tractable connection between two models that have been investigated in theoretical origin-of-life studies.

q-bio.PE

Phase transition and landscape statistics of the number partitioning problem

The phase transition in the number partitioning problem (NPP), i.e., the transition from a region in the space of control parameters in which almost all instances have many solutions to a region in which almost all instances have no solution, is investigated by examining the energy landscape of this classic optimization problem. This is achieved by coding the information about the minimum energy paths connecting pairs of minima into a tree structure, termed a barrier tree, the leaves and internal nodes of which represent, respectively, the minima and the lowest energy saddles connecting those minima. Here we apply several measures of shape (balance and symmetry) as well as of branch lengths (barrier heights) to the barrier trees that result from the landscape of the NPP, aiming at identifying traces of the easy/hard transition. We find that it is not possible to tell the easy regime from the hard one by visual inspection of the trees or by measuring the barrier heights. Only the {\it difficulty} measure, given by the maximum value of the ratio between the barrier height and the energy surplus of local minima, succeeded in detecting traces of the phase transition in the tree. In adddition, we show that the barrier trees associated with the NPP are very similar to random trees, contrasting dramatically with trees associated with the $p$ spin-glass and random energy models. We also examine critically a recent conjecture on the equivalence between the NPP and a truncated random energy model.

cond-mat

Shapes of tree representations of spin-glass landscapes

Much of the information about the multi-valley structure of disordered spin systems can be convened in a simple tree structure -- a barrier tree -- the leaves and internal nodes of which represent, respectively, the local minima and the lowest energy saddles connecting those minima. Here we apply several statistics used in the study of phylogenetic trees to barrier trees that result from the energy landscapes of p-spin models. These statistics give information about the shape of these barrier trees, in particular about balance and symmetry. We then ask if they can be used to classify different types of landscapes, compare them with results obtained from random trees, and investigate the structure of subtrees of the barrier trees. We conclude that at least one of the used statistics is capable of distinguishing different types of landscapes, that the barrier trees from p-spin energy landscapes are quite different from random trees, and that subtrees of barrier trees do not reflect the overall tree structure, but their structure is correlated with their ``depth'' in the tree.

cond-mat.dis-nn