Related papers: Statistical convergence of Markov experiments to d…
We perform an error analysis for numerical approximation methods of continuous time Markov chain models commonly found in the chemistry and biochemistry literature. The motivation for the analysis is to be able to compare the accuracy of…
We consider triangular arrays of Markov chains that converge weakly to a diffusion process. Second order Edgeworth type expansions for transition densities are proved. The paper differs from recent results in two respects. We allow…
We study the spread of discrete-time epidemics over arbitrary networks for well-known propagation models, namely SIS (susceptible-infected-susceptible), SIR (susceptible-infected-recovered), SIRS (susceptible-infected-recovered-susceptible)…
In this paper a new dissimilarity measure to identify groups of assets dynamics is proposed. The underlying generating process is assumed to be a diffusion process solution of stochastic differential equations and observed at discrete time.…
This paper presents a strong convergence rate analysis of general discretization approximations for McKean-Vlasov SDEs with super-linear growth coefficients over infinite time horizon. Under some specified non-globally Lipschitz conditions,…
It is well known and readily seen that the maximum of $n$ independent and uniformly on $[0,1]$ distributed random variables, suitably standardised, converges in total variation distance, as $n$ increases, to the standard negative…
We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Specially, consider a random walk on a regular Markov chain and a Hermitian matrix-valued…
We consider the problem of the discrete-time approximation of the solution of a one-dimensional SDE with piecewise locally Lipschitz drift and continuous diffusion coefficients with polynomial growth. In this paper, we study the strong…
The strong convergence of Euler approximations of stochastic delay differential equations is proved under general conditions. The assumptions on drift and diffusion coefficients have been relaxed to include polynomial growth and only…
In this paper we consider the convergence of the conditional entropy to the entropy rate for Markov chains. Convergence of certain statistics of long range dependent processes, such as the sample mean, is slow. It has been shown in Carpio…
We investigate the scaling limit of the seed bank diffusion when reproduction and migration (to and from the seed bank) happen on different time-scales. More precisely, we consider the case when migration is `slow' and reproduction is…
This article shows the geometric decay rate of Euler-Maruyama scheme for one-dimensional stochastic differential equation towards its invariant probability measure under total variation distance. Firstly, the existence and uniqueness of…
The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of…
We propose a method to approximate continuous-time, continuous-state stochastic processes by a discrete-time Markov chain defined on a nonuniform grid. Our method provides exact moment matching for processes whose first and second moments…
We prove an averaging principle which asserts convergence of diffusion processes on domains separated by semi-permeable membranes, when diffusion coefficients tend to infinity while the flux through the membranes remains constant. In the…
We study stochastic optimal control problems for (possibly degenerate) McKean-Vlasov controlled diffusions and obtain discrete-time as well as finite interacting particle approximations. (i) Under mild assumptions, we first prove the…
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…
We prove that for a random walk on the real line whose increments have zero mean and are either integer-valued or spread out (i.e. the distributions of the steps of the walk are eventually non-singular), the Markov chain of overshoots above…
Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and then stick together. There is, however, a very peculiar kind…
Consider longitudinal networks whose edges turn on and off according to a discrete-time Markov chain with exponential-family transition probabilities. We characterize when their joint distributions are also exponential families with the…