Quantitative characterization of Gaussian small ball probabilities

The quantitative study of the Gaussian measure of symmetric convex sets is a central theme at the interface of probability theory and convex geometry. From a probabilistic perspective, it amounts to analyzing the tail behavior of suprema of Gaussian processes. The typical magnitude and upper tail of Gaussian processes are well-understood, thanks to Talagrand's celebrated Majorizing Measures theorem and to Gaussian concentration. In contrast, despite fundamental connections with metric entropy established by Kuelbs and Li, no general sharp characterization of the lower tail is available. In this work, we close this gap by establishing a sharp two-sided characterization of Gaussian small ball probabilities, involving both metric entropy and local widths of the underlying convex body. This yields an explicit chaining-type description of lower quantiles of Gaussian processes in terms of the metric structure of the convexified index set, as well as a general comparison inequality for convex sets. We further obtain analogous quantitative characterizations of two important geometric quantities associated with symmetric convex sets, namely intrinsic volumes (quermassintegrals) and the radii of random sections beyond the classical Dvoretzky range. A unifying theme of these results is the central role of convexity in the quantitative understanding of small ball probabilities.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.17071
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantitative characterization of Gaussian small ball probabilities

Jaouad Mourtada
arXiv (Cornell University)
Point processes and geometric inequalities
preprint

Quantitative characterization of Gaussian small ball probabilities

Jaouad Mourtada
preprint en

Abstract

The quantitative study of the Gaussian measure of symmetric convex sets is a central theme at the interface of probability theory and convex geometry. From a probabilistic perspective, it amounts to analyzing the tail behavior of suprema of Gaussian processes. The typical magnitude and upper tail of Gaussian processes are well-understood, thanks to Talagrand's celebrated Majorizing Measures theorem and to Gaussian concentration. In contrast, despite fundamental connections with metric entropy established by Kuelbs and Li, no general sharp characterization of the lower tail is available. In this work, we close this gap by establishing a sharp two-sided characterization of Gaussian small ball probabilities, involving both metric entropy and local widths of the underlying convex body. This yields an explicit chaining-type description of lower quantiles of Gaussian processes in terms of the metric structure of the convexified index set, as well as a general comparison inequality for convex sets. We further obtain analogous quantitative characterizations of two important geometric quantities associated with symmetric convex sets, namely intrinsic volumes (quermassintegrals) and the radii of random sections beyond the classical Dvoretzky range. A unifying theme of these results is the central role of convexity in the quantitative understanding of small ball probabilities.

arXiv (Cornell University)
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon