Metraipolis › archive › dc_7c3c33e76897

Convex Order Comparisons for Sub-Gamma Random Variables — arXiv:2609.02398

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02398
License (as archived)
CC0-1.0
Archived
2026-10-17T05:26:25.983Z
SHA-256 of the archived text
042bd820af09bf659ef29a57a12ec0e781da7f86800541c1d7a12e1cce4cba4e
Stable URL of this page
https://metraipolis.com/documento/dc_7c3c33e76897

How to cite

Convex Order Comparisons for Sub-Gamma Random Variables — arXiv:2609.02398 — arXiv (en), https://arxiv.org/abs/2609.02398 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c3c33e76897 (Metraipolis archive dc_7c3c33e76897, sha256 042bd820af09bf659ef29a57a12ec0e781da7f86800541c1d7a12e1cce4cba4e)
BibTeX
@misc{dc7c3c33e76897,
  title = {Convex Order Comparisons for Sub-Gamma Random Variables — arXiv:2609.02398},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02398},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c3c33e76897; sha256 042bd820af09bf659ef29a57a12ec0e781da7f86800541c1d7a12e1cce4cba4e},
  year = {2026}
}

Archived text

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

Recent work has shown that sub-Gaussian random variables are dominated in convex order by a sharp multiple of a Gaussian. We study the analogous question for the sub-Gamma class underlying Bernstein's inequality, with the Laplace law as the majorant. Here the moment generating function is controlled by a Bernstein-type bound over a finite range of frequencies, rather than by a purely quadratic bound. We derive a variational formula for the optimal multiple, show that it is strictly larger than the natural scale $\sigma \vee \alpha$, and prove that this value is sharp, being attained by an asymmetric two-point distribution. We then turn to the sub-exponential class, which has a quadratic bound as in the sub-Gaussian case, but only over a bounded range as in the sub-Gamma case. Interestingly, the sub-exponential class displays a different behavior: the optimal multiple is exactly $\sigma \vee \alpha$, but is attained only when $\alpha \leq \sigma$; when $\alpha > \sigma$, the constant remains sharp, but equality cannot hold for any non-affine convex function. Both results rely on a sharp finite-range variant of the Kearns-Saul inequality, which is of independent interest.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.02398 — 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-17T04:44:48.585Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).