English
Related papers

Related papers: Cut-off and Escape Behaviors for Birth and Death C…

200 papers

We link two phenomena concerning the asymptotical behavior of stochastic processes: (i) abrupt convergence or cut-off phenomenon, and (ii) the escape behavior usually associated to exit from metastability. The former is characterized by…

Mathematical Physics · Physics 2015-05-13 Javiera Barrera , Olivier Bertoncini , Roberto Fernández

In this paper we present, in the context of Diaconis' paradigm, a general method to detect the cutoff phenomenon. We use this method to prove cutoff in a variety of models, some already known and others not yet appeared in literature,…

Mathematical Physics · Physics 2015-05-27 Carlo Lancia , Francesca R. Nardi , Benedetto Scoppola

For birth and death chains, we derive bounds on the spectral gap and mixing time in terms of birth and death rates. Together with the results of Ding et al. in 2010, this provides a criterion for the existence of a cutoff in terms of the…

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

We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…

Probability · Mathematics 2021-04-13 Nina Gantert , Evita Nestoridi , Dominik Schmid

This paper gives a necessary and sufficient condition for a sequence of birth and death chains to converge abruptly to stationarity, that is, to present a cut-off. The condition involves the notions of spectral gap and mixing time. Y. Peres…

Probability · Mathematics 2007-05-23 Persi Diaconis , Laurent Saloff-Coste

Basic properties of Brownian motion are used to derive two results concerning birth-death chains. First, the probability of extinction is calculated. Second, sufficient conditions on the transition probabilities of a birth-death chain are…

Probability · Mathematics 2011-03-23 Greg Markowsky

Earlier work by Diaconis and Saloff-Coste gives a spectral criterion for a maximum separation cutoff to occur for birth and death chains. Ding, Lubetzky and Peres gave a related criterion for a maximum total variation cutoff to occur in the…

Probability · Mathematics 2015-02-03 Guan-Yu Chen , Laurent Saloff-Coste

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

The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…

Statistical Mechanics · Physics 2009-11-11 L. Pal

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

An elementary proof is given for a theorem showing that certain birth-death chains show martingale-like behavior at large stopping times. This is a generalization of and new proof for a theorem from a earlier paper by the author.

Probability · Mathematics 2011-03-28 Greg Markowsky

In this paper we study the long term evolution of a continuous time Markov chain formed by two interacting birth-and-death processes. The interaction between the processes is modelled by transition rates which are functions with suitable…

Probability · Mathematics 2017-03-23 Mikhail Menshikov , Vadim Shcherbakov

We construct a family of trees on which a lazy simple random walk exhibits total variation cutoff. The main idea behind the construction is that hitting times of large sets should be concentrated around their means. For this sequence of…

Probability · Mathematics 2013-07-11 Yuval Peres , Perla Sousi

We show that a sequence of birth-and-death chains, given by lazy random walks in a (transient) environment (RWRE) on [0; n], exhibits a cutoff in the ballistic regime but does not exhibit a cutoff in the (interior of) the subballistic…

Probability · Mathematics 2013-05-17 Nina Gantert , Thomas Kochler

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

For any distribution $\pi$ with support equal to $[n] = \{1, 2,..., n \}$, we study the set $\mathcal{A}_{\pi}$ of tridiagonal stochastic matrices $K$ satisfying $\pi(i) K[i,j] = \pi(j) K[j,i]$ for all $i, j \in [n]$. These matrices…

Probability · Mathematics 2012-12-27 Aaron Smith

We investigate the tail distribution of the first exit time of Brownian motion with drift from a cone and find its exact asymptotics for a large class of cones. Our results show in particular that its exponential decreasing rate is a…

Probability · Mathematics 2014-08-19 Rodolphe Garbit , Kilian Raschel

We are interested in predator-prey dynamics on infinite trees, which can informally be seen as particular two-type branching processes where individuals may die (or be infected) only after their parent dies (or is infected). We study two…

Probability · Mathematics 2018-02-19 Igor Kortchemski

We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…

Probability · Mathematics 2022-09-07 Vincent Bansaye , Chenlin Gu , Linglong Yuan

We study the mixing time of the Rook's Walk Markov chain on a $d$-dimensional chess board of side length $n\geq 3$, where a rook moves by first selecting an axis uniformly at random and then selecting a new position along that axis…

Probability · Mathematics 2026-04-10 Jonatan Kaare-Rasmussen
‹ Prev 1 2 3 10 Next ›