Metraipolis › archive › dc_36f61b2dfcfa
Sharp Cramér-type moderate deviation bounds for the self-normalized maximum of partial sums — arXiv:2610.21975
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21975
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:29:09.928Z
- SHA-256 of the archived text
cdf7d041e49ef0a39832aa19123fe1358c1080a0db88b2c694dfa602cf922537- Stable URL of this page
https://metraipolis.com/documento/dc_36f61b2dfcfa
How to cite
Sharp Cramér-type moderate deviation bounds for the self-normalized maximum of partial sums — arXiv:2610.21975 — arXiv (en), https://arxiv.org/abs/2610.21975 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_36f61b2dfcfa (Metraipolis archive dc_36f61b2dfcfa, sha256 cdf7d041e49ef0a39832aa19123fe1358c1080a0db88b2c694dfa602cf922537)
BibTeX
@misc{dc36f61b2dfcfa,
title = {Sharp Cramér-type moderate deviation bounds for the self-normalized maximum of partial sums — arXiv:2610.21975},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21975},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_36f61b2dfcfa; sha256 cdf7d041e49ef0a39832aa19123fe1358c1080a0db88b2c694dfa602cf922537},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21975. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $X_1,X_2,\ldots$ be i.i.d. random variables with zero mean and variance $\sigma^2\in(0,\infty)$. In this paper, we establish a sharp Cramér-type moderate deviation for the self-normalized maximum of partial sums under a finite $p$-th absolute moment, $2<p\le3$. In particular, we show that $\mathbb{P}(M_n\ge xV_n)=2(1-\Phi(x))\{1+O(1)\beta_{n,p}(1+x)^p\}$ for $0\le x\le\beta_{n,p}^{-1/p}$, where $M_n=\max_{1\le k\le n}\sum_{j=1}^kX_j$, $V_n=(\sum_{j=1}^nX_j^2)^{1/2}$, $\beta_{n,p}=\mathbb{E}|X_1|^p/(n^{(p-2)/2}\sigma^p)$, and $\Phi$ is the standard normal distribution function. This proves a conjecture of Shao2010. More precisely, we bound the relative error by the same truncated-moment quantity as for self-normalized sums. The proof compares the maximum with the absolute sum while preserving their common denominator, through a reflected-walk representation and Fourier estimates with distribution-adapted smoothing.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.ST, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2610.21975 — 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-16T08:50:02.855Z dalla pagina https://arxiv.org/list/math.ST/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).