Preprint
Sep 2026
Kemeny's constant via matrix compression and eigenvalue interlacing
Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, capturing global properties of a Markov chain. We develop a matrix-analytic framework for bounding Kemeny's constant of a finite connected weighted graph using degree-weighted compressions of the normalized adjacency mat...
A. Abiad, Á. Carmona, A. Encinas et al.
· 0 citations