arXiv (All)
open access
Sharp Tail Bounds Beyond Twice the Mean
Consider $n$ independent, non-negative, mean at most one random variables, $X_1,X_2,\ldots$. We show the following bound on the probability of their sum exceeding a threshold $t$: \[ \mathbb{P}\left[\sum_{i=1}^n X_i\ge t\right] \leq 1-\left(1-\frac{1}{t}\right)^n \text{ for all } t\ge 2n+1 \,.
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
- Stationary activated random walk: regularity, heavy tails, and remixing#1115799
- Stochastic Domination of Gaussian Maxima by the Regular Simplex#1075922
- The threshold for online balancing of i.i.d. binary vectors#1084877
- Lower bounds for discrete moments in a conjecture of Ng#1062928
- MaxCut for $\mathrm{MTP}_2$ Covariances#997353
Record · ID 1036755
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