Separation cut-offs for birth and death chains

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 has observed that for many families of Markov chains, there is a cut-off if and only if the product of spectral gap and mixing time tends to infinity. We establish this for arbitrary birth and death chains in continuous time when the convergence is measured in separation and the chains all start at 0.

[1]  Igor Pak,et al.  On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes , 2001, Discret. Appl. Math..

[2]  R. B. Lenin,et al.  An inverse problem in birth and death processes , 1999 .

[3]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[4]  L. Saloff-Coste,et al.  Lectures on finite Markov chains , 1997 .

[5]  P. Diaconis,et al.  LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[7]  P. Diaconis,et al.  Time to reach stationarity in the Bernoulli-Laplace diffusion model , 1987 .

[8]  J. A. Fill.  Strong stationary duality for continuous-time Markov chains. Part I: Theory , 1992 .

[9]  E. Bannai,et al.  Algebraic Combinatorics I: Association Schemes , 1984 .

[10]  Persi Diaconis,et al.  What Do We Know about the Metropolis Algorithm? , 1998, J. Comput. Syst. Sci..

[11]  P. Diaconis,et al.  The cutoff phenomenon in finite Markov chains. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[12]  R. B. Lenin,et al.  Spectral representation of four finite birth and death processes , 1999 .

[13]  P. Diaconis,et al.  Strong Stationary Times Via a New Form of Duality , 1990 .

[14]  A. D'Aristotile,et al.  The nearest neighbor random walk on subspaces of a vector space and rate of convergence , 1995 .

[15]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[16]  Wim Schoutens.  Birth and Death Processes, Random Walks, and Orthogonal Polynomials , 2000 .

[17]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[18]  P. Diaconis,et al.  Eigen Analysis for Some Examples of the Metropolis Algorithm , 1992 .

[19]  P. Diaconis,et al.  SHUFFLING CARDS AND STOPPING-TIMES , 1986 .

[20]  Peter Winkler,et al.  Mixing times , 1997, Microsurveys in Discrete Probability.

[21]  Mark Brown,et al.  Identifying Coefficients in the Spectral Representation for First Passage Time Distributions , 1987, Probability in the Engineering and Informational Sciences.

[22]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[23]  J. Curtiss.  A Note on the Theory of Moment Generating Functions , 1942 .

[24]  P. Diaconis,et al.  Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques , 2004, math/0401318.

[25]  J. Letessier,et al.  Dual birth and death processes and orthogonal polynomials , 1986 .

[26]  P. Diaconis,et al.  Comparison Techniques for Random Walk on Finite Groups , 1993 .

[27]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[28]  Samuel Karlin,et al.  Ehrenfest urn models , 1965 .

[29]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[30]  F. Steutel,et al.  Infinite Divisibility of Probability Distributions on the Real Line , 2003 .

[31]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[32]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[33]  Eric David Belsley.  Rates of convergence of random walk on distance regular graphs , 1998 .

[34]  P. Diaconis,et al.  Strong uniform times and finite random walks , 1987 .