Kemeny's constant for non-backtracking random walks

Jane Breen, Nolan Faught, Cory Glover +3

Kemeny's constant for a connected graph $G$ is the expected time for a random walk to reach a randomly-chosen vertex $u$, regardless of the choice of the initial vertex. We extend…