English

On Kemeny's constant and stochastic complement

Numerical Analysis 2024-09-16 v2 Numerical Analysis

Abstract

Given a stochastic matrix PP partitioned in four blocks PijP_{ij}, i,j=1,2i,j=1,2, Kemeny's constant κ(P)\kappa(P) is expressed in terms of Kemeny's constants of the stochastic complements P1=P11+P12(IP22)1P21P_1=P_{11}+P_{12}(I-P_{22})^{-1}P_{21}, and P2=P22+P21(IP11)1P12P_2=P_{22}+P_{21}(I-P_{11})^{-1}P_{12}. 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}
}
R2 v1 2026-06-28T13:57:48.074Z