arXiv (All)
open access
Concentration inequalities for strong laws and laws of the iterated logarithm
We derive concentration inequalities for sums of independent and identically distributed random variables that yield non-asymptotic generalizations of several strong laws of large numbers including some of those due to Kolmogorov [1930], Marcinkiewicz and Zygmund [1937], Chung [1951], Baum and Katz
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
- The Exact Law of Large Numbers for Independent Random Matching#21082
- Nonasymptotic and distribution-uniform Komlós-Major-Tusnády approximation#1063740
- Breaking the Infinite Barrier in the $\frac{1}{3}$--$\frac{2}{3}$ Conjecture#1105447
- Almost sure upper bound for sums of random multiplicative functions and critical chaos#1063992
- The limit points of the strong law of large numbers under the sub-linear expectations#1117194
Record · ID 986798
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