A Fresh Look at the "Hot Hand" Paradox
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929672399355904 |
|---|---|
| author | Redner, S. |
| author_facet | Redner, S. |
| contents | We use the backward Kolmogorov equation approach to understand the apparently paradoxical feature that the mean waiting time to encounter distinct fixed-length sequences of heads and tails upon repeated fair coin flips can be different. For sequences of length 2, the mean time until the sequence HH (heads-heads) appears equals 6, while the waiting time for the sequence HT (heads-tails) equals 4. We give complete results for the waiting times of sequences of lengths 3, 4, and 5; the extension to longer sequences is straightforward (albeit more tedious). We also derive the moment generating functions, from which any moment of the mean waiting time for specific sequences can be found. Finally, we compute the mean waiting times $T_{2n\rm H}$ for $2n$ heads in a row and $T_{n\rm(HT)}$ for $n$ alternating heads and tails. For large $n$, $T_{2n\rm H}\sim 3 T_{n\rm(HT)}$. Thus distinct sequences of coin flips of the same length can have very different mean waiting times. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1910_09707 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | A Fresh Look at the "Hot Hand" Paradox Redner, S. Popular Physics Statistical Mechanics History and Overview We use the backward Kolmogorov equation approach to understand the apparently paradoxical feature that the mean waiting time to encounter distinct fixed-length sequences of heads and tails upon repeated fair coin flips can be different. For sequences of length 2, the mean time until the sequence HH (heads-heads) appears equals 6, while the waiting time for the sequence HT (heads-tails) equals 4. We give complete results for the waiting times of sequences of lengths 3, 4, and 5; the extension to longer sequences is straightforward (albeit more tedious). We also derive the moment generating functions, from which any moment of the mean waiting time for specific sequences can be found. Finally, we compute the mean waiting times $T_{2n\rm H}$ for $2n$ heads in a row and $T_{n\rm(HT)}$ for $n$ alternating heads and tails. For large $n$, $T_{2n\rm H}\sim 3 T_{n\rm(HT)}$. Thus distinct sequences of coin flips of the same length can have very different mean waiting times. |
| title | A Fresh Look at the "Hot Hand" Paradox |
| topic | Popular Physics Statistical Mechanics History and Overview |
| url | https://arxiv.org/abs/1910.09707 |