Completion problems and sparsity for Kemeny’s constant
Canadian mathematical bulletin, Tome 68 (2025) no. 1, pp. 1-18

Voir la notice de l'article provenant de la source Cambridge

DOI

For a partially specified stochastic matrix, we consider the problem of completing it so as to minimize Kemeny’s constant. We prove that for any partially specified stochastic matrix for which the problem is well defined, there is a minimizing completion that is as sparse as possible. We also find the minimum value of Kemeny’s constant in two special cases: when the diagonal has been specified and when all specified entries lie in a common row.
DOI : 10.4153/S0008439524000419
Mots-clés : Kemeny’s constant, stochastic matrix, matrix completion
Kirkland, Steve. Completion problems and sparsity for Kemeny’s constant. Canadian mathematical bulletin, Tome 68 (2025) no. 1, pp. 1-18. doi: 10.4153/S0008439524000419
@article{10_4153_S0008439524000419,
     author = {Kirkland, Steve},
     title = {Completion problems and sparsity for {Kemeny{\textquoteright}s} constant},
     journal = {Canadian mathematical bulletin},
     pages = {1--18},
     year = {2025},
     volume = {68},
     number = {1},
     doi = {10.4153/S0008439524000419},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/S0008439524000419/}
}
TY  - JOUR
AU  - Kirkland, Steve
TI  - Completion problems and sparsity for Kemeny’s constant
JO  - Canadian mathematical bulletin
PY  - 2025
SP  - 1
EP  - 18
VL  - 68
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/S0008439524000419/
DO  - 10.4153/S0008439524000419
ID  - 10_4153_S0008439524000419
ER  - 
%0 Journal Article
%A Kirkland, Steve
%T Completion problems and sparsity for Kemeny’s constant
%J Canadian mathematical bulletin
%D 2025
%P 1-18
%V 68
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/S0008439524000419/
%R 10.4153/S0008439524000419
%F 10_4153_S0008439524000419

Cité par Sources :