An error bound in the Sudakov-Fernique inequality

Abstract

We obtain an asymptotically sharp error bound in the classical Sudakov-Fernique comparison inequality for finite collections of gaussian random variables. Our proof is short and self-contained, and gives an easy alternative argument for the classical inequality, extended to the case of non-centered processes.

This will appear as a theorem in Robert Adler's new book with Jonathan Taylor on gaussian processes; will not be submitted to any journal in its present form

Cited by in corpus (14)

• Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors
• Gaussian approximation of suprema of empirical processes
• Sharp thresholds for high-dimensional and noisy recovery of sparsity
• Bootstrapping High Dimensional Time Series
• Gaussian Prepivoting for Finite Population Causal Inference
• Non-negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
• The Lasso under Heteroscedasticity
• Sublinear Optimal Policy Value Estimation in Contextual Bandits
• Restricted eigenvalue property for corrupted Gaussian designs
• Comparison inequalities on Wiener space
• Estimating the Penalty Level of ${\ell }_1$-minimization via Two Gaussian Approximation Methods
• New and refined bounds for expected maxima of fractional Brownian motion
• Least Squares Estimation of a Quasiconvex Regression Function
• Remarks on the interpolation method