The Kemeny constant for finite homogeneous ergodic Markov chains
DOI10.1007/s10915-010-9382-1zbMath1203.65023OpenAlexW2082025215WikidataQ56750916 ScholiaQ56750916MaRDI QIDQ618621
Michael Neumann, Nung-Sing Sze, Stephen J. Kirkland, Minerva Catral
Publication date: 16 January 2011
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-010-9382-1
Markov chainsnonnegative matricesstochastic matricesdirected graphsmean first passage timesgroup inversesstationary distribution vectors
Numerical analysis or methods applied to Markov chains (65C40) Random matrices (algebraic aspects) (15B52) Stochastic matrices (15B51) Internet topics (68M11)
Related Items (15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On group inverses of \(M\)-matrices with uniform diagonal entries
- Non-negative matrices and Markov chains. 2nd ed
- Markov chain sensitivity measured by mean first passage times
- Generalized inverses. Theory and applications.
- Mixing times with applications to perturbed Markov chains
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- Matrix Analysis
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- Kemeny's Constant and the Random Surfer
- A Matrix Perturbation View of the Small World Phenomenon
- Deeper Inside PageRank
- The Group Inverse Associated with an Irreducible Periodic Nonnegative Matrix
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- Diagonally dominant matrices
This page was built for publication: The Kemeny constant for finite homogeneous ergodic Markov chains