Hitting Time Distribution for Skip-Free Markov Chains: A Simple Proof
Abstract
A well-known theorem for an irreducible skip-free chain with absorbing state d, under some conditions, is that the hitting (absorbing) time of state d starting from state 0 is distributed as the sum of d independent geometric (or exponential) random variables. The purpose of this paper is to present a direct and simple proof of the theorem in the cases of both discrete and continuous time skip-free Markov chains. Our proof is to calculate directly the generation functions (or Laplace transforms) of hitting times in terms of the iteration method.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.