A proof of the Markov chain tree theorem

DOI10.1016/0167-7152(89)90016-3zbMath0679.60069MaRDI QIDQ1822840

Venkat Anantharam, Pantelis Tsoucas

Publication date: 1989

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-7152(89)90016-3

zbMATH Keywords

stationary distribution; time reversal; weighted directed graph; Markov chain tree theorem; arborescence

Mathematics Subject Classification ID

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

Related Items

Orbits of rotor-router operation and stationary distribution of random walks on directed graphs, Rayleigh processes, real trees, and root growth with re-grafting, Stochastic dynamics of discrete curves and multi-type exclusion processes, Money as minimal complexity, Abelian sandpile model and Biggs-Merino polynomial for directed graphs, A combinatorial proof of a formula of Biane and Chapuy, Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph, Codes and noncommutative stochastic matrices, Laplacian matrices and spanning trees of tree graphs, Dynamics in near-potential games, Polynomials Associated with Finite Markov Chains

Cites Work

• The frequency of cyclic processes in biological multistate systems
• A Flow-Graph Formula for the Stationary Distribution of a Markov Chain
• Estimating a probability using finite memory
• Unnamed Item
• Unnamed Item
• Unnamed Item