Displaying similar documents to “Random walks on trees and matchings.”

Random walk centrality and a partition of Kemeny's constant

Stephen J. Kirkland (2016)

Czechoslovak Mathematical Journal


We consider an accessibility index for the states of a discrete-time, ergodic, homogeneous Markov chain on a finite state space; this index is naturally associated with the random walk centrality introduced by Noh and Reiger (2004) for a random walk on a connected graph. We observe that the vector of accessibility indices provides a partition of Kemeny's constant for the Markov chain. We provide three characterizations of this accessibility index: one in terms of the first return time...