Metraipolis › archive › dc_55e4bec22888

Discrete total variation under the multinomial, Part 3: expectation under a general distribution — arXiv:2610.41255

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41255
License (as archived)
CC0-1.0
Archived
2026-11-02T07:58:06.454Z
SHA-256 of the archived text
d3bed14763ff8b75e211b09384db06736cb61c52d242107c184a09c3655d5314
Stable URL of this page
https://metraipolis.com/documento/dc_55e4bec22888

How to cite

Discrete total variation under the multinomial, Part 3: expectation under a general distribution — arXiv:2610.41255 — arXiv (en), https://arxiv.org/abs/2610.41255 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_55e4bec22888 (Metraipolis archive dc_55e4bec22888, sha256 d3bed14763ff8b75e211b09384db06736cb61c52d242107c184a09c3655d5314)
BibTeX
@misc{dc55e4bec22888,
  title = {Discrete total variation under the multinomial, Part 3: expectation under a general distribution — arXiv:2610.41255},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41255},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_55e4bec22888; sha256 d3bed14763ff8b75e211b09384db06736cb61c52d242107c184a09c3655d5314},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41255. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For multinomial counts $X\sim\operatorname{Mult}(N;\mathbf p)$ on $n$ ordered bins and a reference law $\mathbf r$ we study the expectation of the reference-centered discrete total variation $d_{\mathbf r}(X)=\sum_{j=1}^{n-1}|(X_{j+1}-Nr_{j+1})-(X_j-Nr_j)|$, the natural extension of the comb-test statistic to a non-uniform null. For a non-uniform null the raw total variation of the counts carries a deterministic staircase of order $N$ that no centering of the statistic removes; the counts are therefore centered at the reference law, and under the null ($\mathbf p=\mathbf r$) the statistic is the matched $d_{\mathbf p}$. Exact finite-sample expectations are obtained by conditioning on the total mass in each adjacent pair, which reduces every edge to a translated binomial absolute-deviation problem. For fixed $n\ge3$ and a sampling law bounded away from the boundary of the simplex, the matched statistic admits a three-term asymptotic expansion in powers of $1/N$ whose coefficients are explicit continuous periodic functions of $N(p_{j+1}-p_j)$ (a generalized, non-Poincaré asymptotic expansion), obtained by a weighted local Edgeworth estimate and a corner Euler--Maclaurin summation; all half-integer orders vanish by parity. Each correction separates into a smooth Edgeworth part and an oscillatory lattice part, the latter an Edgeworth perturbation of one formal Euler--Maclaurin series of a Gaussian lattice sum. Under a sampling law $\mathbf p\neq\mathbf r$ the leading expectation is the folded-normal profile implied by the central limit theorem; under local alternatives we identify the $O(1)$ correction (a skewness term, plus a variance-gradient term for Pitman alternatives), and fixed alternatives give a law-of-large-numbers limit, the $\ell_1$ distance between the adjacent-gradient profiles of $\mathbf p$ and $\mathbf r$, on which threshold tests are consistent.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.ST, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2610.41255 — 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-11-02T07:42:00.866Z dalla pagina https://arxiv.org/list/math.ST/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).