36 citations · 196 across the 30 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.PR2017
Recurrence of Markov chain traces
Itai Benjamini, Jonathan Hermon
It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with…
math.PR2017★ 1 cited
Reversibility of the non-backtracking random walk
Jonathan Hermon
Let be a connected graph of uniformly bounded degree. A non-backtracking random walk (-NBRW) on evolves according to the following rule: Give…
math.PR2017★ 8 cited
Cutoff for Ramanujan graphs via degree inflation
Jonathan Hermon
Recently Lubetzky and Peres showed that simple random walks on a sequence of -regular Ramanujan graphs of increasing sizes exhibit cutoff in total variation arou…