Related papers: Joint density for the local times of continuous-ti…

We establish that if a sequence of electrical networks equipped with conductance measures converges in the local Gromov--Hausdorff-vague topology and satisfies certain non-explosion and metric-entropy conditions,then the sequence of…

In this paper we study Markov chains associated with the Metropolis-Hastings algorithm. We consider conditions under which the sequence of the successive densities of such a chain converges to the target density according to the total…

The local time in an ensemble of particles measures the amount of time the particles spend in the vicinity of a given point in space. Here we study fluctuations of the empirical time average $R= T^{-1}\int_{0}^{T}\rho\left(x=0,t\right)\,dt$…

Let X_{n} be an integer valued Markov Chain with finite state space. Let S_{n}=\sum_{k=0}^{n}X_{k} and let L_{n}(x) be the number of times S_{k} hits x up to step n. Define the normalized local time process t_{n}(x) by…

We study inhomogeneous continuous-time weakly ergodic Markov chains with a finite state space. We introduce the notion of a Markov chain with the regular structure of an infinitesimal matrix and study the sharp upper bounds on the rate of…

We consider Markov chains on general state spaces in stationary random environment which are defined by a random mapping that is contractive up to a bounded perturbation. We prove their convergence to a limiting law, providing convergence…

We study a notion of local time for a continuous path, defined as a limit of suitable discrete quantities along a general sequence of partitions of the time interval. Our approach subsumes other existing definitions and agrees with the…

Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example…

By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…

We investigate the problem of quantifying contraction coefficients of Markov transition kernels in Kantorovich ($L^1$ Wasserstein) distances. For diffusion processes, relatively precise quantitative bounds on contraction rates have recently…

We study the ergodic behaviour of a discrete-time process $X$ which is a Markov chain in a stationary random environment. The laws of $X_t$ are shown to converge to a limiting law in (weighted) total variation distance as $t\to\infty$.…

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 study a continuous pathwise local time of order p for continuous functions with finite p-th variation along a sequence of time partitions, for even integers p >= 2. With this notion, we establish a Tanaka-type change of variable formula,…

In this paper we are concerned with hitting times of a family of density-dependent Markov chains. A moderate deviation principle of the hitting time is given. The proof of the main theorem relies heavily on moderate deviations of…

Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

We consider the model of Brownian motion indexed by the Brownian tree, which has appeared in a variety of different contexts in probability, statistical physics and combinatorics. For this model, the total occupation measure is known to…

For a finite state Markov process and a finite collection $\{ \Gamma_k, k \in K \}$ of subsets of its state space, let $\tau_k$ be the first time the process visits the set $\Gamma_k$. We derive explicit/recursive formulas for the joint…

We introduce a discrete-time random walk model on a one-dimensional lattice with a nonconstant sojourn time and prove that the discrete density converges to a solution of a continuum diffusion equation. Our random walk model is not…

We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary…