On Kemeny's constant and stochastic complement
Numerical Analysis
2024-09-16 v2 Numerical Analysis
Abstract
Given a stochastic matrix partitioned in four blocks , , Kemeny's constant is expressed in terms of Kemeny's constants of the stochastic complements , and . Specific cases concerning periodic Markov chains and Kronecker products of stochastic matrices are investigated. Bounds to Kemeny's constant of perturbed matrices are given. Relying on these theoretical results, a divide-and-conquer algorithm for the efficient computation of Kemeny's constant of graphs is designed. Numerical experiments performed on real-world problems show the high efficiency and reliability of this algorithm.
Cite
@article{arxiv.2312.13201,
title = {On Kemeny's constant and stochastic complement},
author = {Dario Andrea Bini and Fabio Durastante and Sooyeong Kim and Beatrice Meini},
journal= {arXiv preprint arXiv:2312.13201},
year = {2024}
}