Kemeny's constant for nonbacktracking random walks
From MaRDI portal
Publication:6076721
DOI10.1002/rsa.21144arXiv2203.12049OpenAlexW4322009295MaRDI QIDQ6076721
Nolan Faught, Adam Knudson, Unnamed Author, Mark Kempton, Jane Breen, Cory Glover
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.12049
Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- A non-backtracking Pólya's theorem
- On a conjecture concerning spanning tree invariants and loop systems
- Some spectral properties of the non-backtracking matrix of a graph
- Non-backtracking PageRank
- Mixing times with applications to perturbed Markov chains
- Spectral redemption in clustering sparse networks
- Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Kemeny's Constant and the Random Surfer
- Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
This page was built for publication: Kemeny's constant for nonbacktracking random walks