105 citations · 379 across the 28 of their papers we have counts for
Showing 2007 · math.PRShow all
2 papers · 2 filters
math.PR2007
Poisson approximation for non-backtracking random walks
Noga Alon, Eyal Lubetzky
Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method…
math.PR2007
Many Random Walks Are Faster Than One
Noga Alon, Chen Avin, Michal Koucky +3
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from…