Metraipolis › archive › dc_fefcf244485c

A Note on the Finite-Exceedance Dependence Principle for Sum--Maximum Asymptotic Independence — arXiv:2611.03351

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03351
License (as archived)
CC0-1.0
Archived
2026-11-03T18:46:36.189Z
SHA-256 of the archived text
5719594787787fc2b6f15705663a4a0710964ca0cd8424cedae92c605d1fa7f2
Stable URL of this page
https://metraipolis.com/documento/dc_fefcf244485c

How to cite

A Note on the Finite-Exceedance Dependence Principle for Sum--Maximum Asymptotic Independence — arXiv:2611.03351 — arXiv (en), https://arxiv.org/abs/2611.03351 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fefcf244485c (Metraipolis archive dc_fefcf244485c, sha256 5719594787787fc2b6f15705663a4a0710964ca0cd8424cedae92c605d1fa7f2)
BibTeX
@misc{dcfefcf244485c,
  title = {A Note on the Finite-Exceedance Dependence Principle for Sum--Maximum Asymptotic Independence — arXiv:2611.03351},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03351},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fefcf244485c; sha256 5719594787787fc2b6f15705663a4a0710964ca0cd8424cedae92c605d1fa7f2},
  year = {2026}
}

Archived text

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

Asymptotic independence between sum-type and maximum-type statistics arises repeatedly across many areas of probability and statistics, particularly in high-dimensional testing and random matrix theory. Motivated by the shared structure underlying existing proofs, which is obscured by their model-specific formulations, this note isolates a common intermediate principle. We introduce a finite-exceedance dependence principle: if the finite-exceedance dependence error vanishes at every fixed order and high-order exceedances are mildly controlled, then a finite-order Bonferroni argument yields asymptotic independence between the sum and the maximum. We further give an independent-proxy criterion for verifying this: for each finite set of exceedances, it suffices to construct an exactly independent proxy for the sum-type statistic whose approximation error is negligible in aggregate. Local deletion under dependency graphs and Gaussian regression and residualization are two examples. The framework gives modular derivations of existing sum--max independence results.

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/2611.03351 — 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-03T18:14:52.871Z dalla pagina https://arxiv.org/list/math.ST/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).