Reversibility of the non-backtracking random walk

DOI10.1214/18-AIHP949zbMath1434.60185arXiv1707.01601MaRDI QIDQ2291971

Jonathan Hermon

Publication date: 31 January 2020

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.01601

zbMATH Keywords

recurrencetransiencenon-backtracking random walk

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Metastable Markov chains, A spectral characterization for concentration of the cover time

Cites Work

• Unnamed Item
• Cutoff on all Ramanujan graphs
• A non-backtracking Pólya's theorem
• Markov chain comparison
• Comparison theorems for reversible Markov chains
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• Random walks on the random graph
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Non-backtracking random walk
• Cutoff for nonbacktracking random walks on sparse random graphs
• A Dirichlet principle for non reversible Markov chains and some recurrence theorems
• Transient Markov Chains with Stationary Measures
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Non-Backtracking Random Walks and Cogrowth of Graphs
• Cogrowth of Regular Graphs
• Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure
• A Solution to a Set of Fundamental Equations in Markov Chains