On hitting times and fastest strong stationary times for skip-free and more general chains

DOI10.1007/S10959-009-0233-7MaRDI QIDQ842402zbMATHOpenAlexFDO

Authors James Allen Fill

Publication date 25 September 2009

Published in Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0708.4258

zbMATH Keywords

Markov chainsEigenvaluesAbsorption timeBirth-and-death chainsFastest strong stationary timesPassage timeSkip-free chainsStochastic monotonicityStrong stationary duality

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on general state spaces (60J25) Stopping times; optimal stopping problems; gambling theory (60G40) Transition functions, generators and resolvents (60J35)

Abstract: An (upward) skip-free Markov chain with the set of nonnegative integers as state space is a chain for which upward jumps may be only of unit size; there is no restriction on downward jumps. In a 1987 paper, Brown and Shao determined, for an irreducible continuous-time skip-free chain and any d, the passage time distribution from state 0 to state d. When the nonzero eigenvalues nu_j of the generator are all real, their result states that the passage time is distributed as the sum of d independent exponential random variables with rates nu_j. We give another proof of their theorem. In the case of birth-and-death chains, our proof leads to an explicit representation of the passage time as a sum of independent exponential random variables. Diaconis and Miclo recently obtained the first such representation, but our construction is much simpler. We obtain similar (and new) results for a fastest strong stationary time T of an ergodic continuous-time skip-free chain with stochastically monotone time-reversal started in state 0, and we also obtain discrete-time analogs of all our results. In the paper's final section we present extensions of our results to more general chains.

Recommendations

• Hitting time distribution for skip-free Markov chains: a simple proof
• Spectral Theory for Skip-Free Markov Chains
• The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
• Strong stationary duality for continuous-time Markov chains. I: Theory
• ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS

Cites work

• Coincidence properties of birth and death processes
• Identifying Coefficients in the Spectral Representation for First Passage Time Distributions
• Matrix Analysis
• On functions which preserve the class of Stieltjes matrices
• On times to quasi-stationarity for birth and death processes
• Spectral Polynomial Algorithms for Computing Bi-Diagonal Representations for Phase Type Distributions and Matrix-Exponential Distributions
• Strong stationary duality for continuous-time Markov chains. I: Theory
• Strong stationary times via a new form of duality
• The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
• Time to Stationarity for a Continuous-Time Markov Chain

Cited in

(33)

• On Markov intertwining relations and primal conditioning
• The birth-death processes with regular boundary: stationarity and quasi-stationarity
• Antiduality and Möbius monotonicity: generalized coupon collector problem
• Fluctuations analysis of finite discrete birth and death chains with emphasis on Moran models with mutations
• Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings
• On strong stationary times and approximation of Markov chain hitting times by geometric sums
• Analysis of non-reversible Markov chains via similarity orbits
• Monotonicity for continuous-time random walks
• Hitting time distributions for denumerable birth and death processes
• Duality and intertwining for discrete Markov kernels: relations and examples
• On times to quasi-stationarity for birth and death processes
• The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
• Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line
• Total variation cutoff in birth-and-death chains
• Hitting time and mixing time bounds of Stein's factors
• A note on the passage time of finite-state Markov chains
• Intertwining, excursion theory and Krein theory of strings for non-self-adjoint Markov semigroups
• Sharp bounds for NBUE distributions
• On hitting time, mixing time and geometric interpretations of Metropolis-Hastings reversiblizations
• Hitting time distribution for skip-free Markov chains: a simple proof
• Separation cutoff for upward skip-free chains
• Usual and stochastic tail orders between hitting times for two Markov chains
• On absorption times and Dirichlet eigenvalues
• Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
• Sharp moderate maximal inequalities for upward skip-free Markov chains
• Large deviation behavior for the longest head run in an IID Bernoulli sequence
• Skip-free Markov chains
• ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS
• Computable bounds on the spectral gap for unreliable Jackson networks
• Strong stationary duality for Möbius monotone Markov chains
• On interweaving relations
• Spectral expansions of non-self-adjoint generalized Laguerre semigroups
• Spectral Theory for Skip-Free Markov Chains

This page was built for publication: On hitting times and fastest strong stationary times for skip-free and more general chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842402)