Abstract
AbstractKemeny'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 walks. We explore the relationship between these two parameters for several families of graphs and provide closed‐form expressions for regular and biregular graphs. In nearly all cases, the nonbacktracking variant yields the smaller Kemeny's constant.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
