Metraipolis › archive › dc_613790966c5b
A Superdiffusive Local Limit Theorem for the Elephant Random Walk and the Breakdown of Log-Concavity — arXiv:2609.14753
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14753
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:18:47.313Z
- SHA-256 of the archived text
cf19361467afde10e7f6a0cab92981c4cb76750ca3f1a07a42f9839892734490- Stable URL of this page
https://metraipolis.com/documento/dc_613790966c5b
How to cite
A Superdiffusive Local Limit Theorem for the Elephant Random Walk and the Breakdown of Log-Concavity — arXiv:2609.14753 — arXiv (en), https://arxiv.org/abs/2609.14753 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_613790966c5b (Metraipolis archive dc_613790966c5b, sha256 cf19361467afde10e7f6a0cab92981c4cb76750ca3f1a07a42f9839892734490)
BibTeX
@misc{dc613790966c5b,
title = {A Superdiffusive Local Limit Theorem for the Elephant Random Walk and the Breakdown of Log-Concavity — arXiv:2609.14753},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14753},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_613790966c5b; sha256 cf19361467afde10e7f6a0cab92981c4cb76750ca3f1a07a42f9839892734490},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14753. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $(S_n)_{n\geq 1}$ be the one-dimensional Elephant Random Walk (ERW) in the superdiffusive regime, with memory parameter $p\in(3/4,1)$ and first-step bias $\mathbb{P}(S_1=1)=q$. Set $a=2p-1\in(1/2,1)$. If $f_{q,a}$ denotes the density of the superdiffusive limit $L_{q,a}$, we prove the uniform local limit theorem $\lim_{n\to\infty}\sup_{j\in\mathbb{Z},\,j\equiv n\;(\mathrm{mod}\;2)}\left|\frac{n^a}{2}\mathbb{P}(S_n=j)-f_{q,a}(j/n^a)\right|=0$. The proof uses the exact recurrence for the probability mass function of $S_n$, yielding uniform $O(n^{-a})$ and $O(n^{-2a})$ bounds for the p.m.f. and its first discrete differences, respectively. We then disprove a conjecture of Guérin, Laulin, Raschel and Simon concerning eventual log-concavity. Writing $L_a=L_{1,a}$ and $f_a=f_{1,a}$, let $a_{\rm ev}$ be the eventual-log-concavity threshold and let $a_\star$ be the upper failure threshold for log-concavity of $f_a$. Their results imply $a_{\rm ev}\geq(\sqrt{5}-1)/2$, and we prove $(\sqrt{5}-1)/2\leq a_{\rm ev}\leq\min\{0.80399,a_\star\}\leq a_\star<0.918$. The bound $a_\star<0.918$ follows from the first three exact moments of $L_a$ and the sharp skewness inequality for centered log-concave distributions, while $a_{\rm ev}\leq0.80399$ follows from a certified finite-order analysis of the exact p.m.f. recurrence. Direct numerical iterations provide evidence that $a_{\rm ev}\approx0.80399$, equivalently $p_{\rm ev}\approx0.902$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.14753 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:31:28.423Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).