English
Related papers

Related papers: The $L^2$-cutoffs for reversible Markov chains

200 papers

A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…

Probability · Mathematics 2018-01-19 Riddhipratim Basu , Jonathan Hermon , Yuval Peres

We make a connection between the continuous time and lazy discrete time Markov chains through the comparison of cutoffs and mixing time in total variation distance. For illustration, we consider finite birth and death chains and provide a…

Probability · Mathematics 2013-04-18 Guan-Yu Chen , Laurent Saloff-Coste

We present new concentration of measure inequalities for Markov chains, generalising results for chains that are contracting in Wasserstein distance. These are particularly suited to establishing the cut-off phenomenon for suitable chains.…

Probability · Mathematics 2022-05-24 Andrew Barbour , Graham Brightwell , Malwina Luczak

In this paper, we consider a general class of two-time-scale Markov chains whose transition rate matrix depends on a parameter $\lambda>0$. We assume that some transition rates of the Markov chain will tend to infinity as…

Probability · Mathematics 2015-07-10 Chen Jia

We study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix $P$ the mass is essentially concentrated on few entries. Moreover,…

Probability · Mathematics 2018-01-23 Charles Bordenave , Pietro Caputo , Justin Salez

In this article, we consider products of ergodic Markov chains and discuss their cutoffs in the total variation. Through a new inequality relating the total variation and the Hellinger distance, we may identify the total variation cutoffs…

Probability · Mathematics 2017-02-13 Guan-Yu Chen , Takashi Kumagai

Consider a Markov chain with finite state $\{0, 1, ..., d\}$. We give the generation functions (or Laplace transforms) of absorbing (passage) time in the following two situations : (1) the absorbing time of state $d$ when the chain starts…

Probability · Mathematics 2014-12-09 Wenming Hong , Ke Zhou

We consider discrete time Markov chains with Polish state space. The large deviations principle for empirical measures of a Markov chain can equivalently be stated in Laplace principle form, which builds on the convex dual pair of relative…

Probability · Mathematics 2026-01-14 Stephan Eckstein

The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence to stationarity. In 1996, Diaconis surveyed this phenomenon, and asked how one could recognize its occurrence in families of finite…

Probability · Mathematics 2008-10-06 Jian Ding , Eyal Lubetzky , Yuval Peres

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

Probability · Mathematics 2018-01-23 Charles Bordenave , Pietro Caputo , Justin Salez

A popular method to compute first-passage probabilities in continuous-time Markov chains is by numerically inverting their Laplace transforms. Past decades, the scientific computing community has developed excellent numerical methods for…

Numerical Analysis · Mathematics 2020-04-01 Debarati Bhaumik , Marko A. A. Boon , Daan Crommelin , Barry Koren , Bert Zwart

A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card…

Probability · Mathematics 2015-04-10 Anna Ben-Hamou , Justin Salez

We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer…

Probability · Mathematics 2008-05-19 Nicholas James , Russell Lyons , Yuval Peres

In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…

Probability · Mathematics 2016-11-08 Christoph Reisinger

This review paper, written for the second edition of the Handbook of Markov Chain Monte Carlo, provides an introduction to the study of convergence analysis for Markov chain Monte Carlo (MCMC), aimed at researchers new to the field. We…

Statistics Theory · Mathematics 2024-09-24 Qian Qin

We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…

Probability · Mathematics 2014-12-23 Volker Betz , Stéphane Le Roux

We recover the Donsker-Varadhan large deviations principle (LDP) for the empirical measure of a continuous time Markov chain on a countable (finite or infinite) state space from the joint LDP for the empirical measure and the empirical flow…

Probability · Mathematics 2013-01-01 L. Bertini , A. Faggionato , D. Gabrielli

We study irreducible time-homogenous Markov chains with finite state space in discrete time. We obtain results on the sensitivity of the stationary distribution and other statistical quantities with respect to perturbations of the…

Probability · Mathematics 2007-05-23 Eilon Solan , Nicolas Vieille

The cutoff phenomenon is an abrupt transition from out of equilibrium to equilibrium undergone by certain Markov processes in the limit where the size of the state space tends to infinity: instead of decaying gradually over time, their…

Probability · Mathematics 2025-08-29 Justin Salez

We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by…

Formal Languages and Automata Theory · Computer Science 2016-06-27 Przemysław Daca , Thomas A. Henzinger , Jan Křetínský , Tatjana Petrov
‹ Prev 1 2 3 10 Next ›