Searcharxiv⌕ Search

arXiv subjects

Chaojie Yuan

Publications and source records attributed to Chaojie Yuan.

5 recordsLinked to original sources

Boundary-induced slow mixing for Markov chains and its application to stochastic reaction networks

Markov chains on the non-negative quadrant of dimension $d$ are often used to model the stochastic dynamics of the number of $d$ entities, such as $d$ chemical species in stochastic reaction networks. The infinite state space poses technical challenges, and the boundary of the quadrant can have a dramatic effect on the long term behavior of these Markov chains. For instance, the boundary can slow down the convergence speed of an ergodic Markov chain towards its stationary distribution due to the extinction or the lack of an entity. In this paper, we quantify this slow-down for a class of stochastic reaction networks and for more general Markov chains on the non-negative quadrant. We establish general criteria for such a Markov chain to exhibit a power-law lower bound for its mixing time. The lower bound is of order $|x|^θ$ for all initial state $x$ on a boundary face of the quadrant, where $θ$ is characterized by the local behavior of the Markov chain near the boundary of the quadrant. A better understanding of how these lower bounds arise leads to insights into how the structure of chemical reaction networks contributes to slow-mixing.

math.PR↗

Constrained Langevin approximation for the Togashi-Kaneko model of autocatalytic reactions

The Togashi Kaneko model (TK model), introduced by Togashi and Kaneko in 2001, 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. The CLA, obtained by Anderson et al. in 2019, is an obliquely reflected diffusion process on the positive orthant and hence it respects the constrain 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 6. Our simulations suggest that, under the classical scaling, the CLA is a good approximation to the TK model in terms of both the stationary distribution and the transition times between patterns.

math.PR↗

Variance of finite difference methods for reaction networks with non-Lipschitz rate functions

Parametric sensitivity analysis is a critical component in the study of mathematical models of physical systems. Due to its simplicity, finite difference methods are used extensively for this analysis in the study of stochastically modeled reaction networks. Different coupling methods have been proposed to build finite difference estimators, with the "split coupling," also termed the "stacked coupling," yielding the lowest variance in the vast majority of cases. Analytical results related to this coupling are sparse, and include an analysis of the variance of the coupled processes under the assumption of globally Lipschitz intensity functions [Anderson, SIAM Numerical Analysis, Vol. 50, 2012]. Because of the global Lipschitz assumption utilized in [Anderson, SIAM Numerical Analysis, Vol. 50, 2012], the main result there is only applicable to a small percentage of the models found in the literature, and it was conjectured that similar results should hold for a much wider class of models. In this paper we demonstrate this conjecture to be true by proving the variance of the coupled processes scales in the desired manner for a large class of non-Lipschitz models. We further extend the analysis to allow for time dependence in the parameters. In particular, binary systems with or without time-dependent rate parameters, a class of models that accounts for the vast majority of systems considered in the literature, satisfy the assumptions of our theory.

math.NA↗

Time-dependent product-form Poisson distributions for reaction networks with higher order complexes

It is well known that stochastically modeled reaction networks that are complex balanced admit a stationary distribution that is a product of Poisson distributions. In this paper, we consider the following related question: supposing that the initial distribution of a stochastically modeled reaction network is a product of Poissons, under what conditions will the distribution remain a product of Poissons for all time? By drawing inspiration from Crispin Gardiner's "Poisson representation" for the solution to the chemical master equation, we provide a necessary and sufficient condition for such a product-form distribution to hold for all time. Interestingly, the condition is a dynamical "complex-balancing" for only those complexes that have multiplicity greater than or equal to two (i.e. the higher order complexes that yield non-linear terms to the dynamics). We term this new condition the "dynamical and restricted complex balance" condition (DR for short).

math.PR↗

Low variance couplings for stochastic models of intracellular processes with time-dependent rate functions

A number of coupling strategies are presented for stochastically modeled biochemical processes with time-dependent parameters. In particular, the stacked coupling is introduced and is shown via a number of examples to provide an exceptionally low variance between the generated paths. This coupling will be useful in the numerical computation of parametric sensitivities and the fast estimation of expectations via multilevel Monte Carlo methods. We provide the requisite estimators in both cases.

math.NA↗