Related papers: Statistical inference for ergodic diffusion with M…
Markov chain Monte Carlo methods for exponential family models with intractable normalizing constant, such as the exchange algorithm, require simulations of the sufficient statistics at every iteration of the Markov chain, which often…
In this paper we present a novel method for estimating the parameters of a parametric diffusion processes. Our approach is based on a closed-form Maximum Likelihood estimator for an approximating Continuous Time Markov Chain (CTMC) of the…
In this note, we present a version of Hoeffding's inequality in a continuous-time setting, where the data stream comes from a uniformly ergodic diffusion process. Similar to the well-studied case of Hoeffding's inequality for discrete-time…
This paper provides a new path method that can be used to determine when an ergodic continuous-time Markov chain on $\mathbb Z^d$ converges exponentially fast to its stationary distribution in $L^2$. Specifically, we provide general…
This paper uses the generator approach of Stein's method to analyze the gap between steady-state distributions of Markov chains and diffusion processes. Until now, the standard way to invoke Stein's method for this problem was to use the…
We revisit the problem of estimating the parameters of a partially observed diffusion process, consisting of a hidden state process and an observed process, with a continuous time parameter. The estimation is to be done online, i.e. the…
We develop a general theory dealing with stochastic models for dynamical systems that are governed by various nonlinear, ordinary or partial differential, equations. In particular, we address the problem how flows in the random medium…
The article considers parameter estimation constructing such as quasi-maximum likelyhood estimation and one step estimation in statistical models generated by solution of stochastic differential equation. It has been developed a software…
We study the estimation of the value function for continuous-time Markov diffusion processes using a single, discretely observed ergodic trajectory. Our work provides non-asymptotic statistical guarantees for the least-squares…
A Markov chain (MC) formalism is used to investigate the mean-square displacement (MSD) of a random walker on Newman-Watts (NW) networks. It leads to a precise analysis of the conditions for the emergence of anomalous sub- or…
We establish a simple variance inequality for U-statistics whose underlying sequence of random variables is an ergodic Markov Chain. The constants in this inequality are explicit and depend on computable bounds on the mixing rate of the…
Irreversible drift-diffusion processes are very common in biochemical reactions. They have a non-equilibrium stationary state (invariant measure) which does not satisfy detailed balance. For the corresponding Fokker-Planck equation on a…
A simple Markov process is considered involving a diffusion in one direction and a transport in a transverse direction. Quantitative mixing rate estimates are obtained with limited assumptions about the transport field, which might be…
We study a Markov process with two components: the first component evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of the second component. The second…
This paper studies the spread dynamics of a stochastic SIRS epidemic model with nonlinear incidence and varying population size, which is formulated as a piecewise deterministic Markov process. A threshold dynamic determined by the basic…
A Markov chain is geometrically ergodic if it converges to its in- variant distribution at a geometric rate in total variation norm. We study geo- metric ergodicity of deterministic and random scan versions of the two-variable Gibbs…
This paper studies the sensitivity analysis of mass-action systems against their diffusion approximations, particularly the dependence on population sizes. As a continuous time Markov chain, a mass-action system can be described by a…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
Einstein's explanation of Brownian motion provided one of the cornerstones which underlie the modern approaches to stochastic processes. His approach is based on a random walk picture and is valid for Markovian processes lacking long-term…
The first aim of the present note is to quantify the speed of convergence of a conditioned process toward its Q-process under suitable assumptions on the quasi-stationary distribution of the process. Conversely, we prove that, if a…