Infrequent steering lets random walks on bounded-degree graphs visit every vertex in n to the 1 plus little-o of 1 steps with high probability, using a decomposition of the graph into small-diameter pieces.
Time-biased random walks and robustness of expanders
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster random walks via infrequent steering
Infrequent steering lets random walks on bounded-degree graphs visit every vertex in n to the 1 plus little-o of 1 steps with high probability, using a decomposition of the graph into small-diameter pieces.