An official website of the United States government
The Togashi Kaneko model (TK model) is a simple stochastic reaction network that displays discreteness-induced transitions between meta-stable patterns. Here we study a constrained Langevin approximation (CLA) of this model. This CLA, derived under the classical scaling, is an obliquely reflected diffusion process on the positive orthant and hence respects the constraint that chemical concentrations are never negative. We show that the CLA is a Feller process, is positive Harris recurrent and converges exponentially fast to the unique stationary distribution. We also characterize the stationary distribution and show that it has finite moments. In addition, we simulate both the TK model and its CLA in various dimensions. For example, we describe how the TK model switches between meta-stable patterns in dimension six. Our simulations suggest that, when the volume of the vessel in which all of the reactions that take place is large, the CLA is a good approximation of the TK model in terms of both the stationary distribution and the transition times between patterns.
more »
« less
Error bounds for one-dimensional constrained Langevin approximations for nearly density-dependent Markov chains
Abstract Continuous-time Markov chains are frequently used to model the stochastic dynamics of (bio)chemical reaction networks. However, except in very special cases, they cannot be analyzed exactly. Additionally, simulation can be computationally intensive. An approach to address these challenges is to consider a more tractable diffusion approximation. Leite and Williams (Ann. Appl. Prob.29, 2019) proposed a reflected diffusion as an approximation for (bio)chemical reaction networks, which they called the constrained Langevin approximation (CLA) as it extends the usual Langevin approximation beyond the first time some chemical species becomes zero in number. Further explanation and examples of the CLA can be found in Anderson et al.( SIAM Multiscale Modeling Simul.17, 2019). In this paper, we extend the approximation of Leite and Williams to (nearly) density-dependent Markov chains, as a first step to obtaining error estimates for the CLA when the diffusion state space is one-dimensional, and we provide a bound for the error in a strong approximation. We discuss some applications for chemical reaction networks and epidemic models, and illustrate these with examples. Our method of proof is designed to generalize to higher dimensions, provided there is a Lipschitz Skorokhod map defining the reflected diffusion process. The existence of such a Lipschitz map is an open problem in dimensions more than one.
more »
« less
- Award ID(s):
- 2153866
- PAR ID:
- 10587737
- Publisher / Repository:
- Cambridge University Press
- Date Published:
- Journal Name:
- Advances in Applied Probability
- Volume:
- 56
- Issue:
- 3
- ISSN:
- 0001-8678
- Page Range / eLocation ID:
- 825 to 867
- Subject(s) / Keyword(s):
- Density-dependent Markov chains diffusion approximation constrained Langevin approximation error bound linear noise approximation chemical reaction networks stochastic differential equation with oblique reflection systems biology
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In the article “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Networks39(1) (2002), 53‐60), Williams introduced an extended formulation for the spanning tree polytope of a planar graph. This formulation is remarkably small (using onlyO(n) variables and constraints) and remarkably strong (defining an integral polytope). In this note, we point out that Williams' formulation, as originally stated, is incorrect. Specifically, we construct a binary feasible solution to Williams' formulation that does not represent a spanning tree. Fortunately, there is a simple fix, which is to restrict the choice of the root vertices in the primal and dual spanning trees, whereas Williams explicitly allowed them to be chosen arbitrarily. The same flaw and fix apply to a subsequent formulation of Williams (“A zero‐one programming model for contiguous land acquisition.” Geographical Analysis34(4) (2002), 330‐349).more » « less
-
Abstract When implementing Markov Chain Monte Carlo (MCMC) algorithms, perturbation caused by numerical errors is sometimes inevitable. This paper studies how the perturbation of MCMC affects the convergence speed and approximation accuracy. Our results show that when the original Markov chain converges to stationarity fast enough and the perturbed transition kernel is a good approximation to the original transition kernel, the corresponding perturbed sampler has fast convergence speed and high approximation accuracy as well. Our convergence analysis is conducted under either the Wasserstein metric or the$$\chi^2$$metric, both are widely used in the literature. The results can be extended to obtain non-asymptotic error bounds for MCMC estimators. We demonstrate how to apply our convergence and approximation results to the analysis of specific sampling algorithms, including Random walk Metropolis, Metropolis adjusted Langevin algorithm with perturbed target densities, and parallel tempering Monte Carlo with perturbed densities. Finally, we present some simple numerical examples to verify our theoretical claims.more » « less
-
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
-
Abstract AutoMeKin2021 is an updated version of tsscds2018, a program for the automated discovery of reaction mechanisms (J. Comput. Chem.2018,39, 1922). This release features a number of new capabilities: rare‐event molecular dynamics simulations to enhance reaction discovery, extension of the original search algorithm to study van der Waals complexes, use of chemical knowledge, a new search algorithm based on bond‐order time series analysis, statistics of the chemical reaction networks, a web application to submit jobs, and other features. The source code, manual, installation instructions and the website link are available at:https://rxnkin.usc.es/index.php/AutoMeKinmore » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1017/apr.2024.25
