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).
Asymptotic normality of superdiffusive step-reinforced random walks
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.PR 2verdicts
UNVERDICTED 2representative citing papers
Elephant random walks on d-regular infinite trees have asymptotic speed (d-2)/d independent of memory parameter p, with p-dependent upper bounds on convergence rate that exhibit a phase transition at p_d = (d+1)/(2d).
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).
-
Elephant random walks on infinite Cayley trees
Elephant random walks on d-regular infinite trees have asymptotic speed (d-2)/d independent of memory parameter p, with p-dependent upper bounds on convergence rate that exhibit a phase transition at p_d = (d+1)/(2d).