42 citations · 45 across the 10 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.ST2017
Estimating graph parameters with random walks
Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres
An algorithm observes the trajectories of random walks over an unknown graph , starting from the same vertex , as well as the degrees along the trajectories. For all finite c…
math.PR2017
Comparing mixing times on sparse random graphs
Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres
It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs. To analyze typical irregu…
math.PR2017
Cutoff for a stratified random walk on the hypercube
Anna Ben-Hamou, Yuval Peres
We consider the random walk on the hypercube which moves by picking an ordered pair of distinct coordinates uniformly at random and adding the bit at location to the bi…