Tree formulas, mean first passage times and Kemeny’s constant of a Markov chain
Authors:
- Jim PitmanJPJim Pitman
- Wenpin TangWTWenpin Tang
- 1 August 2018
- journal article
- research article
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 24 (3) , 1942-1972
Abstract
Project Euclid - mathematics and statistics onlineKeywords
All Related Versions
This publication has 81 references indexed in Scilit:
- Simplicial matrix-tree theoremsTransactions of the American Mathematical Society, 2009
- The sand-pile model and Tutte polynomialsAdvances in Applied Mathematics, 2003
- Forest Volume Decompositions and Abel–Cayley–Hurwitz Multinomial ExpansionsJournal of Combinatorial Theory, Series A, 2002
- Uniform spanning forestsThe Annals of Probability, 2001
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed GraphJournal of Algorithms, 1998
- Bideterminants, arborescences and extension of the Matrix-Tree theorem to semiringsDiscrete Mathematics, 1997
- Self-organized critical state of sandpile automaton modelsPhysical Review Letters, 1990
- Spanning tree formulas and chebyshev polynomialsGraphs and Combinatorics, 1986
- Enumeration of forests in a graphProceedings of the American Mathematical Society, 1981
- Dimer problem in statistical mechanics-an exact resultPhilosophical Magazine, 1961