Communication in Statistics- Theory and Methods · 2014 · 89 citations · 29 references
EngineeringMathematicsAlgorithmsProbability TheoryStochastic ProcessesMarkov ChainsMarkov ProcessesFinite Markov ChainsFinite-state Markov ChainsMarkov Chain Mixing RatesMarkov Chains On GraphsMixing Times
In a finite irreducible Markov chain with stationary probabilities {π i } and mean first passage times m ij (mean recurrence time when i = j) it was first shown, by Kemeny and Snell (1960 Kemeny , J. G. , Snell , J. L. ( 1960 ). Finite Markov Chains . Princeton, NJ : Van Nostrand . Republished (1976) as Finite Markov Chains: With a New Appendix Generalization of a Fundamental Matrix. New York: Springer-Verlag . [Google Scholar]), that is a constant, K, (Kemeny's constant) not depending on i. A variety of techniques for finding expressions and bounds for K are given. The main interpretation focuses on its role as the expected time to mixing in a Markov chain. Various applications are considered including perturbation results, mixing on directed graphs and its relation to the Kirchhoff index of regular graphs.
29
Keith Bush, John G. Kemeny, J. Laurie Snell · American Mathematical Monthly · 1960 · 1.6K citations
Douglas J. Klein, Milan Randić · Journal of Mathematical Chemistry · 1993 · 1.4K citations
Reversible Markov Chains and Random Walks on Graphs
David Aldous, James Allen Fill · 2014 · 968 citations