An official website of the United States government
Abstract Continuous time Markov chains are commonly used as models for the stochastic behavior of chemical reaction networks. More precisely, these Stochastic Chemical Reaction Networks (SCRNs) are frequently used to gain a mechanistic understanding of how chemical reaction rate parameters impact the stochastic behavior of these systems. One property of interest is mean first passage times (MFPTs) between states. However, deriving explicit formulas for MFPTs can be highly complex. In order to address this problem, we first introduce the concept of$$coclique\, level\, structure$$and develop theorems to determine whether certain SCRNs have this feature by studying associated graphs. Additionally, we develop an algorithm to identify, under specific assumptions, all possible coclique level structures associated with a given SCRN. Finally, we demonstrate how the presence of such a structure in a SCRN allows us to derive closed form formulas for both upper and lower bounds for the MFPTs. Our methods can be applied to SCRNs taking values in a generic finite state space and can also be applied to models with non-mass-action kinetics. We illustrate our results with examples from the biological areas of epigenetics, neurobiology and ecology.
more »
« less
Diffusive search and trajectories on tubular networks: a propagator approach
Abstract Several organelles in eukaryotic cells, including mitochondria and the endoplasmic reticulum, form interconnected tubule networks extending throughout the cell. These tubular networks host many biochemical pathways that rely on proteins diffusively searching through the network to encounter binding partners or localized target regions. Predicting the behavior of such pathways requires a quantitative understanding of how confinement to a reticulated structure modulates reaction kinetics. In this work, we develop both exact analytical methods to compute mean first passage times and efficient kinetic Monte Carlo algorithms to simulate trajectories of particles diffusing in a tubular network. Our approach leverages exact propagator functions for the distribution of transition times between network nodes and allows large simulation time steps determined by the network structure. The methodology is applied to both synthetic planar networks and organelle network structures, demonstrating key general features such as the heterogeneity of search times in different network regions and the functional advantage of broadly distributing target sites throughout the network. The proposed algorithms pave the way for future exploration of the interrelationship between tubular network structure and biomolecular reaction kinetics. Graphic Abstract
more »
« less
- PAR ID:
- 10252397
- Date Published:
- Journal Name:
- The European Physical Journal E
- Volume:
- 44
- Issue:
- 6
- ISSN:
- 1292-8941
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Despite the advances in discovering new nuclei, modeling microscopic nuclear structure, nuclear reactors, and stellar nucleosynthesis, we still lack a systemic tool, such as a network approach, to understand the structure and dynamics of over 70 thousands reactions compiled in JINA REACLIB. To this end, we develop an analysis framework, under which it is simple to know which reactions generally are possible and which are not, by counting neutrons and protons incoming to and outgoing from any target nucleus. Specifically, we assemble here a nuclear reaction network in which a node represents a nuclide, and a link represents a direct reaction between nuclides. Interestingly, the degree distribution of nuclear network exhibits a bimodal distribution that significantly deviates from the common power-law distribution of scale-free networks and Poisson distribution of random networks. Based on the dynamics from the cross section parameterizations in REACLIB, we surprisingly find that the distribution is universal for reactions with a rate below the threshold, λ < e − T γ , where T is the temperature and γ ≈ 1.05. Moreover, we discover three rules that govern the structure pattern of nuclear reaction network: (i) reaction-type is determined by linking choices, (ii) network distances between the reacting nuclides on 2D grid of Z vs N of nuclides are short, and (iii) each node in- and out-degrees are close to each other. By incorporating these three rules, our model universally unveils the underlying nuclear reaction patterns hidden in a large and dense nuclear reaction network regardless of nuclide chart expansions. It enables us to predict missing links that represent possible new nuclear reactions not yet discovered.more » « less
-
Abstract Characterizing the reaction energies and barriers of reaction networks is central to catalyst development. However, heterogeneous catalytic surfaces pose several unique challenges to automatic reaction network characterization, including large sizes and open-ended reactant sets, that make ad hoc network construction the current state-of-the-art. Here, we show how automated network exploration algorithms can be adapted to the constraints of heterogeneous systems using ethylene oligomerization on silica-supported single-site Ga 3+ as a model system. Using only graph-based rules for exploring the network and elementary constraints based on activation energy and size for identifying network terminations, a comprehensive reaction network is generated and validated against standard methods. The algorithm (re)discovers the Ga-alkyl-centered Cossee-Arlman mechanism that is hypothesized to drive major product formation while also predicting several new pathways for producing alkanes and coke precursors. These results demonstrate that automated reaction exploration algorithms are rapidly maturing towards general purpose capability for exploratory catalytic applications.more » « less
-
Signaling and metabolic pathways, which consist of a series of reactions producing target molecules from source compounds, are cornerstones of cellular biology. The cellular reaction networks containing such pathways can be precisely modeled by directed hypergraphs, where each reaction corresponds to a hyperedge, directed from its set of reactants to its set of products. Given such a network represented by a directed hypergraph, inferring the most likely set of reactions that produce a given target from a given set of sources corresponds to finding a shortest hyperpath, which is NP-complete. The best methods currently available for shortest hyperpaths either offer no guarantee of optimality, or exclude hyperpaths containing cycles even though cycles are abundant in real biological pathways. We derive a novel graph-theoretic characterization of hyperpaths, leveraged in a new formulation of the general shortest hyperpath problem as an integer linear program that for the first time handles hyperpaths containing cycles, and present a novel cutting-plane algorithm that can solve this integer program to optimality in practice. This represents a major advance over the best prior exact algorithm, which was limited to acyclic hyperpaths (and hence fails to find a solution for the many biological instances where all hyperpaths are in fact cyclic). In comprehensive experiments over thousands of instances from the standard NCI-PID and Reactome databases, we demonstrate that our cutting-plane algorithm quickly finds an optimal hyperpath, with a median running-time of under ten seconds and a maximum time of around thirty minutes, even on large instances with many thousands of reactions. Source code implementing our cutting-plane algorithm for shortest hyperpaths in a new tool called Mmunin is available free for research use at http://mmunin.cs.arizona.edu.more » « less
-
Abstract Network formation in elastomers with grafted side chains is investigated to understand the entanglement‐free nature of the bottlebrush architecture. Competition between elastically effective cross‐linkers and dangling side chains creates a unique environment where reaction kinetics and steric effects dictate network percolation. The evolving viscoelasticity of linear and bottlebrush networks with an equivalent number of cross‐linkers to backbones is measured during a catalytic curing reaction using time‐resolved rheology. The impact of reaction kinetics on network formation is addressed through the sol−gel transition by tuning catalyst concentration. Solidification falls into a rate‐limited regime where the modulus growth rate increases with increasing catalyst. The network formation process remains independent of the cure rate in the bottlebrush and linear systems. Side chains significantly decrease the fractal dimension of the critical gel cluster despite a comparable number of cross‐links. Time‐cure superposition is applied to quantify dynamics in the pre‐ and post‐gel states. The divergence of the shift factors around the gel point is independent of cure kinetics. The collapse of shift factors in the post‐gel region further suggests the universality of the network formation process. The approach to understanding internal structure development during processing will be critical as bottlebrush elastomers are utilized among a wide range of applications.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1140/epje/s10189-021-00083-0
