The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof

A well-known theorem usually attributed to Keilson states that, for an irreducible continuous-time birth-and-death chain on the nonnegative integers and any d, the passage time from state 0 to state d is distributed as a sum of d independent exponential random variables. Until now, no probabilistic proof of the theorem has been known. In this paper we use the theory of strong stationary duality to give a stochastic proof of a similar result for discrete-time birth-and-death chains and geometric random variables, and the continuous-time result (which can also be given a direct stochastic proof) then follows immediately. In both cases we link the parameters of the distributions to eigenvalue information about the chain. We also discuss how the continuous-time result leads to a proof of the Ray–Knight theorem.Intimately related to the passage-time theorem is a theorem of Fill that any fastest strong stationary time T for an ergodic birth-and-death chain on {0,…,d} in continuous time with generator G, started in state 0, is distributed as a sum of d independent exponential random variables whose rate parameters are the nonzero eigenvalues of −G. Our approach yields the first (sample-path) construction of such a T for which individual such exponentials summing to T can be explicitly identified.

[1]  Persi Diaconis,et al.  Separation cut-offs for birth and death chains , 2006, math/0702411.

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

[3]  Samuel Karlin,et al.  COINCIDENT PROPERTIES OF BIRTH AND DEATH PROCESSES , 1959 .

[4]  Peter Matthews Strong stationary times and eigenvalues , 1992 .

[5]  A Sample Path Proof of the Duality for Stochastically Monotone Markov Processes , 1985 .

[6]  Persi Diaconis,et al.  On Times to Quasi-stationarity for Birth and Death Processes , 2009 .

[7]  J. T. Cox,et al.  Occupation Times for Critical Branching Brownian Motions , 1985 .

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

[9]  F. Knight,et al.  Random walks and a sojourn density process of Brownian motion , 1963 .

[10]  James Allen Fill,et al.  An interruptible algorithm for perfect sampling via Markov chains , 1997, STOC '97.

[11]  James Allen Fill,et al.  On Hitting Times and Fastest Strong Stationary Times for Skip-Free and More General Chains , 2007, 0708.4258.

[12]  J. T. Kent Probability, Statistics and Analysis: The appearance of a multivariate exponential distribution in sojourn times for birth-death and diffusion processes , 1983 .

[13]  P. Comba,et al.  Part I. Theory , 2007 .

[14]  D. Ray Sojourn times of diffusion processes , 1963 .

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

[16]  C. Micchelli,et al.  On functions which preserve the class of Stieltjes matrices , 1979 .

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

[18]  Julian Keilson Log-concavity and log-convexity in passage time densities of diffusion and birth-death processes , 1971 .

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