pith. sign in

arxiv: 1201.6441 · v2 · pith:I3KO2IEUnew · submitted 2012-01-31 · 🧮 math.PR

Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings

classification 🧮 math.PR
keywords theoremsapproachdistributionshitting-timemarkovchainsconstructionscorresponding
0
0 comments X
read the original abstract

We develop a systematic matrix-analytic approach, based on intertwinings of Markov semigroups, for proving theorems about hitting-time distributions for finite-state Markov chains -- an approach that (sometimes) deepens understanding of the theorems by providing corresponding sample-path-by-sample-path stochastic constructions. We employ our approach to give new proofs and constructions for two theorems due to Mark Brown, theorems giving two quite different representations of hitting-time distributions for finite-state Markov chains started in stationarity. The proof, and corresponding construction, for one of the two theorems elucidates an intriguing connection between hitting-time distributions and the interlacing eigenvalues theorem for bordered symmetric matrices.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.