A proof of the Markov chain tree theorem
From MaRDI portal
Publication:1822840
DOI10.1016/0167-7152(89)90016-3zbMath0679.60069OpenAlexW2075108920MaRDI QIDQ1822840
Pantelis Tsoucas, Venkat Anantharam
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
Related Items
Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ Exact computation of heat capacities for active particles on a graph ⋮ Money as minimal complexity ⋮ Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph ⋮ Abelian sandpile model and Biggs-Merino polynomial for directed graphs ⋮ On resistance distance of Markov chain and its sum rules ⋮ Sensitivity of Steady States in Networks with Application to Markov Chains and Chemical Reaction Networks ⋮ A combinatorial representation for the invariant measure of diffusion processes on metric graphs ⋮ Dynamics in near-potential games ⋮ Codes and noncommutative stochastic matrices ⋮ Orbits of rotor-router operation and stationary distribution of random walks on directed graphs ⋮ A combinatorial proof of a formula of Biane and Chapuy ⋮ Random forests and networks analysis ⋮ Counting trees with random walks ⋮ Laplacian matrices and spanning trees of tree graphs ⋮ Stochastic dynamics of discrete curves and multi-type exclusion processes ⋮ Polynomials Associated with Finite Markov Chains ⋮ Two applications of random spanning forests ⋮ Matrices with zero row sums, tree theorems and a Markov chain on trees ⋮ Trees and forests for nonequilibrium purposes: an introduction to graphical representations ⋮ Generalized Markov chain tree theorem and Kemeny's constant for a class of non-Markovian matrices ⋮ The Buck-Passing Game ⋮ Rayleigh processes, real trees, and root growth with re-grafting
Cites Work
