Poisson approximation for non-backtracking random walks

DOI10.1007/s11856-009-0112-zzbMath1250.60011arXiv0705.0867OpenAlexW2051430128MaRDI QIDQ2655782

Eyal Lubetzky, Noga Alon

Publication date: 26 January 2010

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Applications of sieve methods (11N36) Limit theorems in probability theory (60F99)

Related Items (5)

Reconstruction of domino tilings -- combinatorial and probabilistic questions ⋮ Non-backtracking random walk ⋮ On random permutations of finite groups ⋮ Balanced Allocation on Graphs: A Random Walk Approach ⋮ A model of random industrial SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Undirected ST-connectivity in log-space
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Short random walks on graphs
• Note on a `Multivariate' Form of Bonferroni's Inequalities

This page was built for publication: Poisson approximation for non-backtracking random walks