An Easy Proof of a Weak Version of Chernoff inequality
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911037921427456 |
|---|---|
| author | Har-Peled, Sariel |
| author_facet | Har-Peled, Sariel |
| contents | We prove an easy but very weak version of Chernoff inequality. Namely, that the probability that in $6M$ throws of a fair coin, one gets at most $M$ heads is $\leq 1/2^M$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02759 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Easy Proof of a Weak Version of Chernoff inequality Har-Peled, Sariel Probability Data Structures and Algorithms Combinatorics We prove an easy but very weak version of Chernoff inequality. Namely, that the probability that in $6M$ throws of a fair coin, one gets at most $M$ heads is $\leq 1/2^M$. |
| title | An Easy Proof of a Weak Version of Chernoff inequality |
| topic | Probability Data Structures and Algorithms Combinatorics |
| url | https://arxiv.org/abs/2507.02759 |