Step-reinforced random walks on finite groups converge exponentially to uniform; on cycles mixing time jumps from logarithmic to polynomial at alpha=1/2, while on hypercubes reinforcement slows mixing with cutoff at d log d over F(alpha)(1-alpha).
Transience in growing subgraphs via evolving sets.Ann
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
-
Mixing times of step-reinforced random walks
Step-reinforced random walks on finite groups converge exponentially to uniform; on cycles mixing time jumps from logarithmic to polynomial at alpha=1/2, while on hypercubes reinforcement slows mixing with cutoff at d log d over F(alpha)(1-alpha).