Indexed metadata

Cover times and ranges of elephant random walks

Shuo Qin

Source record

Source: arXiv

Published: Sep 15, 2026

arXiv: 2609.17264

Open original source ↗

Source abstract

We study cover times on discrete tori and ranges on Zd\mathbb{Z}^d for elephant random walks with memory parameter p[0,1)p\in[0,1). In dimension one there is a phase transition at p=3/4p=3/4. Away from criticality we determine the exact first-order asymptotics of the mean cover time, while at p=3/4p=3/4 the mean is of order L2/logLL^2/\sqrt{\log L}, a factor logL\sqrt{\log L} larger than the natural fluctuation scale L2/logLL^2/\log L. We identify the limiting distribution under each of the three natural fluctuation normalizations. In dimensions d2d\geq2, for every fixed p<1p<1, the cover time has the same order as for simple random walk, in expectation and with high probability. The leading constants also agree when p<(2d+1)/(4d)p<(2d+1)/(4d), and at equality when d3d\geq3. For the range on Zd\mathbb{Z}^d, we prove L1L^1 convergence to the simple random walk asymptotics when d=2d=2 and p<5/8p<5/8, and for every p<1p<1 when d3d\geq3. Finally, we give a cover-time upper bound for generalized step-reinforced random walks on finite groups in terms of a conditional LL^\infty mixing profile.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Cover times and ranges of elephant random walks — Mathematical Frontier Network