Tree formulas, mean first passage times and Kemeny's constant of a Markov chain

DOI10.3150/16-BEJ916zbMath1462.60101arXiv1603.09017OpenAlexW3098569369MaRDI QIDQ1697037

Wenpin Tang, Jim W. Pitman

Publication date: 15 February 2018

Published in: Bernoulli (Search for Journal in Brave)

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

zbMATH Keywords

mean first passage timesKirchhoff's matrix tree theoremMarkov chain tree theoremKemeny's constantCayley's formulaGreen tree formulaharmonic tree formulaspanning forests/treesWilson's algorithm

Mathematics Subject Classification ID

Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (14)

Exact and approximate mean first passage times on trees and other necklace structures: a local equilibrium approach ⋮ Analytical results for the distribution of first-passage times of random walks on random regular graphs ⋮ Kemeny's Constant And An Analogue Of Braess' Paradox For Trees ⋮ Hitting time quasi-metric and its forest representation ⋮ Flux in tilted potential systems: negative resistance and persistence ⋮ On resistance distance of Markov chain and its sum rules ⋮ On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival ⋮ A combinatorial representation for the invariant measure of diffusion processes on metric graphs ⋮ A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma" ⋮ Exact results for the first-passage properties in a class of fractal networks ⋮ A proof of the transfer-current theorem in absence of reversibility ⋮ A combinatorial proof of a formula of Biane and Chapuy ⋮ Kemeny's constant for a graph with bridges ⋮ Generalized Markov chain tree theorem and Kemeny's constant for a class of non-Markovian matrices

This page was built for publication: Tree formulas, mean first passage times and Kemeny's constant of a Markov chain