An error bound in the Sudakov-Fernique inequality
classification
🧮 math.PR
keywords
inequalityboundclassicalerrorsudakov-ferniquealternativeargumentasymptotically
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.