Stochastic analysis of reaction-diffusion processes

Narrow capture problem: An encounter-based approach to partially reactive targets

A general topic of current interest is the analysis of diffusion problems in singularly perturbed domains with small interior targets or traps (the narrow capture problem). One major application is to intracellular diffusion, where the targets typically represent some form of reactive biochemical substrate. Most studies of the narrow capture problem treat the target boundaries as totally absorbing (Dirichlet), that is, the chemical reaction occurs immediately on first encounter between particle and target surface. In this paper, we analyze the three-dimensional narrow capture problem in the more realistic case of partially reactive target boundaries. We begin by considering classical Robin boundary conditions. Matching inner and outer solutions of the single-particle probability density, we derive an asymptotic expansion of the Laplace transformed flux into each reactive surface in powers of ε, where ερ is a given target size. In turn, the fluxes determine the splitting probabilities for target absorption. We then extend our analysis to more general types of reactive targets by combining matched asymptotic analysis with an encounter-based formulation of diffusion-mediated surface reactions. That is, we derive an asymptotic expansion of the joint probability density for particle position and the so-called boundary local time, which characterizes the amount of time that a Brownian particle spends in the neighborhood of a point on a totally reflecting boundary. The effects of surface reactions are then incorporated via an appropriate stopping condition for the boundary local time. Robin boundary conditions are recovered in the special case of an exponential law for the stopping local times. Finally, we illustrate the theory by exploring how the leading-order contributions to the splitting probabilities depend on the choice of surface reactions. In particular, we show that there is an effective renormalization of the target radius of the form ρ→ρ-Ψ[over ̃](1/ρ), where Ψ[over ̃] is the Laplace transform of the stopping local time distribution.

The Roles of Signaling in Cytoskeletal Changes, Random Movement, Direction-Sensing and Polarization of Eukaryotic Cells

Movement of cells and tissues is essential at various stages during the lifetime of an organism, including morphogenesis in early development, in the immune response to pathogens, and during wound-healing and tissue regeneration. Individual cells are able to move in a variety of microenvironments (MEs) (A glossary of the acronyms used herein is given at the end) by suitably adapting both their shape and how they transmit force to the ME, but how cells translate environmental signals into the forces that shape them and enable them to move is poorly understood. While many of the networks involved in signal detection, transduction and movement have been characterized, how intracellular signals control re-building of the cyctoskeleton to enable movement is not understood. In this review we discuss recent advances in our understanding of signal transduction networks related to direction-sensing and movement, and some of the problems that remain to be solved.

Multiscale Stochastic Reaction-Diffusion Algorithms Combining Markov Chain Models with Stochastic Partial Differential Equations

Two multiscale algorithms for stochastic simulations of reaction-diffusion processes are analysed. They are applicable to systems which include regions with significantly different concentrations of molecules. In both methods, a domain of interest is divided into two subsets where continuous-time Markov chain models and stochastic partial differential equations (SPDEs) are used, respectively. In the first algorithm, Markov chain (compartment-based) models are coupled with reaction-diffusion SPDEs by considering a pseudo-compartment (also called an overlap or handshaking region) in the SPDE part of the computational domain right next to the interface. In the second algorithm, no overlap region is used. Further extensions of both schemes are presented, including the case of an adaptively chosen boundary between different modelling approaches.

Comparison of Deterministic and Stochastic Regime in a Model for Cdc42 Oscillations in Fission Yeast

Oscillations occur in a wide variety of essential cellular processes, such as cell cycle progression, circadian clocks and calcium signaling in response to stimuli. It remains unclear how intrinsic stochasticity can influence these oscillatory systems. Here, we focus on oscillations of Cdc42 GTPase in fission yeast. We extend our previous deterministic model by Xu and Jilkine to construct a stochastic model, focusing on the fast diffusion case. We use SSA (Gillespie's algorithm) to numerically explore the low copy number regime in this model, and use analytical techniques to study the long-time behavior of the stochastic model and compare it to the equilibria of its deterministic counterpart. Numerical solutions suggest noisy limit cycles exist in the parameter regime in which the deterministic system converges to a stable limit cycle, and quasi-cycles exist in the parameter regime where the deterministic model has a damped oscillation. Near an infinite period bifurcation point, the deterministic model has a sustained oscillation, while stochastic trajectories start with an oscillatory mode and tend to approach deterministic steady states. In the low copy number regime, metastable transitions from oscillatory to steady behavior occur in the stochastic model. Our work contributes to the understanding of how stochastic chemical kinetics can affect a finite-dimensional dynamical system, and destabilize a deterministic steady state leading to oscillations.

Exact lower and upper bounds on stationary moments in stochastic biochemical systems

In the stochastic description of biochemical reaction systems, the time evolution of statistical moments for species population counts is described by a linear dynamical system. However, except for some ideal cases (such as zero- and first-order reaction kinetics), the moment dynamics is underdetermined as lower-order moments depend upon higher-order moments. Here, we propose a novel method to find exact lower and upper bounds on stationary moments for a given arbitrary system of biochemical reactions. The method exploits the fact that statistical moments of any positive-valued random variable must satisfy some constraints that are compactly represented through the positive semidefiniteness of moment matrices. Our analysis shows that solving moment equations at steady state in conjunction with constraints on moment matrices provides exact lower and upper bounds on the moments. These results are illustrated by three different examples-the commonly used logistic growth model, stochastic gene expression with auto-regulation and an activator-repressor gene network motif. Interestingly, in all cases the accuracy of the bounds is shown to improve as moment equations are expanded to include higher-order moments. Our results provide avenues for development of approximation methods that provide explicit bounds on moments for nonlinear stochastic systems that are otherwise analytically intractable.

A hybrid continuous-discrete method for stochastic reaction-diffusion processes

Stochastic fluctuations in reaction-diffusion processes often have substantial effect on spatial and temporal dynamics of signal transductions in complex biological systems. One popular approach for simulating these processes is to divide the system into small spatial compartments assuming that molecules react only within the same compartment and jump between adjacent compartments driven by the diffusion. While the approach is convenient in terms of its implementation, its computational cost may become prohibitive when diffusive jumps occur significantly more frequently than reactions, as in the case of rapid diffusion. Here, we present a hybrid continuous-discrete method in which diffusion is simulated using continuous approximation while reactions are based on the Gillespie algorithm. Specifically, the diffusive jumps are approximated as continuous Gaussian random vectors with time-dependent means and covariances, allowing use of a large time step, even for rapid diffusion. By considering the correlation among diffusive jumps, the approximation is accurate for the second moment of the diffusion process. In addition, a criterion is obtained for identifying the region in which such diffusion approximation is required to enable adaptive calculations for better accuracy. Applications to a linear diffusion system and two nonlinear systems of morphogens demonstrate the effectiveness and benefits of the new hybrid method.

A multi-time-scale analysis of chemical reaction networks: II. Stochastic systems

We consider stochastic descriptions of chemical reaction networks in which there are both fast and slow reactions, and for which the time scales are widely separated. We develop a computational algorithm that produces the generator of the full chemical master equation for arbitrary systems, and show how to obtain a reduced equation that governs the evolution on the slow time scale. This is done by applying a state space decomposition to the full equation that leads to the reduced dynamics in terms of certain projections and the invariant distributions of the fast system. The rates or propensities of the reduced system are shown to be the rates of the slow reactions conditioned on the expectations of fast steps. We also show that the generator of the reduced system is a Markov generator, and we present an efficient stochastic simulation algorithm for the slow time scale dynamics. We illustrate the numerical accuracy of the approximation by simulating several examples. Graph-theoretic techniques are used throughout to describe the structure of the reaction network and the state-space transitions accessible under the dynamics.

Constant-complexity stochastic simulation algorithm with optimal binning

At the molecular level, biochemical processes are governed by random interactions between reactant molecules, and the dynamics of such systems are inherently stochastic. When the copy numbers of reactants are large, a deterministic description is adequate, but when they are small, such systems are often modeled as continuous-time Markov jump processes that can be described by the chemical master equation. Gillespie's Stochastic Simulation Algorithm (SSA) generates exact trajectories of these systems, but the amount of computational work required for each step of the original SSA is proportional to the number of reaction channels, leading to computational complexity that scales linearly with the problem size. The original SSA is therefore inefficient for large problems, which has prompted the development of several alternative formulations with improved scaling properties. We describe an exact SSA that uses a table data structure with event time binning to achieve constant computational complexity with respect to the number of reaction channels for weakly coupled reaction networks. We present a novel adaptive binning strategy and discuss optimal algorithm parameters. We compare the computational efficiency of the algorithm to existing methods and demonstrate excellent scaling for large problems. This method is well suited for generating exact trajectories of large weakly coupled models, including those that can be described by the reaction-diffusion master equation that arises from spatially discretized reaction-diffusion processes.

Stochastic Turing patterns: analysis of compartment-based approaches

Turing patterns can be observed in reaction-diffusion systems where chemical species have different diffusion constants. In recent years, several studies investigated the effects of noise on Turing patterns and showed that the parameter regimes, for which stochastic Turing patterns are observed, can be larger than the parameter regimes predicted by deterministic models, which are written in terms of partial differential equations (PDEs) for species concentrations. A common stochastic reaction-diffusion approach is written in terms of compartment-based (lattice-based) models, where the domain of interest is divided into artificial compartments and the number of molecules in each compartment is simulated. In this paper, the dependence of stochastic Turing patterns on the compartment size is investigated. It has previously been shown (for relatively simpler systems) that a modeler should not choose compartment sizes which are too small or too large, and that the optimal compartment size depends on the diffusion constant. Taking these results into account, we propose and study a compartment-based model of Turing patterns where each chemical species is described using a different set of compartments. It is shown that the parameter regions where spatial patterns form are different from the regions obtained by classical deterministic PDE-based models, but they are also different from the results obtained for the stochastic reaction-diffusion models which use a single set of compartments for all chemical species. In particular, it is argued that some previously reported results on the effect of noise on Turing patterns in biological systems need to be reinterpreted.