English
Related papers

Related papers: Characterization of cutoff for reversible Markov c…

200 papers

For each $n$ let $Y^n_t$ be a continuous time symmetric Markov chain with state space $n^{-1} \Z^d$. A condition in terms of the conductances is given for the convergence of the $Y^n_t$ to a symmetric Markov process $Y_t$ on $\R^d$. We have…

Probability · Mathematics 2008-07-22 R. F. Bass , T. Kumagai , T. Uemura

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

Probability · Mathematics 2016-07-21 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carr\'e du…

Probability · Mathematics 2025-01-23 Francesco Pedrotti , Justin Salez

We present a general method to derive the metastable behavior of weakly mixing Markov chains. This approach is based on properties of the resolvent equations and can be applied to metastable dynamics which do not satisfy the mixing…

Probability · Mathematics 2024-06-21 Claudio Landim , Diego Marcondes , Insuk Seo

Let $(X_t)$ be a discrete time Markov chain on a general state space. It is well-known that if $(X_t)$ is aperiodic and satisfies a drift and minorization condition, then it converges to its stationary distribution $\pi$ at an exponential…

Probability · Mathematics 2019-08-20 Daniel C. Jerison

We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<<k<n/2 particles we show that the mixing time is of order…

Probability · Mathematics 2011-12-14 Hubert Lacoin , Remi Leblond

A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the…

Probability · Mathematics 2022-05-04 Iddo Ben-Ari , Behrang Forghani

The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model on the $d$-dimensional torus $(Z/nZ)^d$…

Probability · Mathematics 2012-11-06 Eyal Lubetzky , Allan Sly

We present a recurrence-transience classification for discrete-time Markov chains on manifolds with negative curvature. Our classification depends only on geometric quantities associated to the increments of the chain, defined via the…

Probability · Mathematics 2020-11-10 John Armstrong , Tim King

Discovered in the context of card shuffling by Aldous, Diaconis and Shahshahani, the cutoff phenomenon has since then been established in a variety of Markov chains. However, proving cutoff remains a delicate affair, which requires a…

Probability · Mathematics 2021-03-02 Justin Salez

In this article we study the so-called cut-off phenomenon in the total variation distance when $n\to \infty$ for the family of continuous-time stochastic processes indexed by $n\in \mathbb{N}$, \[ \left( \mathcal{Z}^{(n)}_t=…

Probability · Mathematics 2023-05-05 Gerardo Barrera

We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We…

Quantum Physics · Physics 2012-02-03 Michael J. Kastoryano , David Reeb , Michael M. Wolf

We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.

Probability · Mathematics 2017-12-06 Louigi Addario-Berry , Matthew I. Roberts

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…

Probability · Mathematics 2021-11-22 Elizabeth L. Wilmer

It has been well known for some time that for strictly stationary Markov chains that are ``reversible'', that special symmetry provides special extra features in the mathematical theory. This paper here is primarily a purely expository…

Probability · Mathematics 2019-10-04 Richard C. Bradley

We consider symmetric Markov chains on $\Bbb Z^d$ where we do {\bf not} assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper…

Probability · Mathematics 2007-05-23 Richard F. Bass , Takashi Kumagai

We consider the simple exclusion process with $k$ particles on a segment of length $N$ performing random walks with transition $p>1/2$ to the right and $q=1-p$ to the left. We focus on the case where the asymmetry in the jump rates…

Probability · Mathematics 2018-06-01 C. Labbé , H. Lacoin

In this article, we consider products of random walks on finite groups with moderate growth and discuss their cutoffs in the total variation. Based on several comparison techniques, we are able to identify the total variation cutoff of…

Probability · Mathematics 2017-05-01 Guan-Yu Chen , Takashi Kumagai

We obtain universal estimates on the convergence to equilibrium and the times of coupling for continuous time irreducible reversible finite-state Markov chains, both in the total variation and in the L^2 norms. The estimates in total…

Probability · Mathematics 2012-01-24 Mykhaylo Shkolnikov

A class of examples is constructed to show that for strictly stationary Markov chains that are reversible, the simultaneous mixing rates for the $\rho$-mixing and strong mixing ($\alpha$-mixing) conditions can be fairly arbitrary, within…

Probability · Mathematics 2022-10-04 Richard C. Bradley