Ask a Question

Prefer a chat interface with context about you and your work?

Kemeny's constant for nonbacktracking random walks

Kemeny's constant for nonbacktracking random walks

Abstract Kemeny's constant for a connected graph is the expected time for a random walk to reach a randomly chosen vertex , regardless of the choice of the initial vertex. We extend the definition of Kemeny's constant to nonbacktracking random walks and compare it to Kemeny's constant for simple random …