Search arXivSearch

arXiv · math/0504477

On hybrid simulation schemes for stochastic reaction dynamics

Abstract

The existing literature on stochastic simulation of chemical reaction networks has a tendency to move as quickly as possible to the abstract formulation of the stochastic dynamics in terms of probabilities based on the concept of the Chemical Master Equation (CME), largely ignoring sample path representation. In this publication we discuss both theoretical basis and numerical approach for the problems in this area using sample path methods as a crucial part of the process. Relying as it does on a representation of the underlying stochastic processes as a weak solution of a system of stochastic differential equations driven by Poisson random measures this approach brings to bear a heretofore ignored but quite effective problem solving methodology. We first present a simple and intuitive way of partitioning species and reactions of the interaction network into different groups. We then discuss how original stochastic dynamics with state dependent intensities of transitions can be reformulated in terms of jump-diffusion stochastic differential equations driven by both Wiener noise sources and Poisson random measures. Finally, we show that this approach facilitates the construction of hybrid simulation techniques, an important step in the creation of efficient techniques for modeling multi-scale stochastic dynamics of the reaction networks. Numerical methods related to sampling events from Poisson random measures are demonstratedon simple intuitive examples. Error control analysis of the finite differences scheme is also presented.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Plyasunov. 2005-04-22. On hybrid simulation schemes for stochastic reaction dynamics. https://arxiv.org/abs/math/0504477

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST