3 citations · 8 across the 11 of their papers we have counts for
1 paper · 1 filter
Shravas Rao, Oded Regev
Consider an expander graph in which a μ fraction of the vertices are marked. A random walk starts at a uniform vertex and at each step continues to a random neighbor. Gillman sho…