arXiv (All)
open access
A very short proof of the subgaussian convex-order comparison theorem
We provide a very short proof of the following comparison theorem, which has recently played an important role: every centered subgaussian random vector is dominated in convex order, up to a universal constant, by a standard Gaussian random vector.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Berry-Esseen bounds for multivariate nonlinear statistics in convex distance#1234389
- Information-Theoretic Upper Bounds for Deterministic Noise in Zeroth-Order Convex Optimization#1129029
- Convex Order Comparisons for Sub-Gamma Random Variables#924281
- Convex Order Comparisons for Sub-Gamma Random Variables#920050
- Sudakov Minoration for Unconditional Log-Concave Vectors#1115738
Record · ID 1217611
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive