Hostname: page-component-89b8bd64d-46n74 Total loading time: 0 Render date: 2026-05-09T12:24:39.538Z Has data issue: false hasContentIssue false

Gambler’s fallacy, hot hand belief, and the time of patterns

Published online by Cambridge University Press:  01 January 2023

Yanlong Sun*
Affiliation:
University of Texas Health Science Center at Houston
Hongbin Wang*
Affiliation:
University of Texas Health Science Center at Houston
*
*Address: Yanlong Sun (Yanlong.Sun@uth.tmc.edu),
Hongbin Wang (Hongbin.Wang@uth.tmc.edu), School of Health Information Sciences, University of Texas Health Science Center at Houston, 7000 Fannin St. Suite 600, Houston, TX 77030.
Rights & Permissions [Opens in a new window]

Abstract

The gambler’s fallacy and the hot hand belief have been classified as two exemplars of human misperceptions of random sequential events. This article examines the times of pattern occurrences where a fair or biased coin is tossed repeatedly. We demonstrate that, due to different pattern composition, two different statistics (mean time and waiting time) can arise from the same independent Bernoulli trials. When the coin is fair, the mean time is equal for all patterns of the same length but the waiting time is the longest for streak patterns. When the coin is biased, both mean time and waiting time change more rapidly with the probability of heads for a streak pattern than for a non-streak pattern. These facts might provide a new insight for understanding why people view streak patterns as rare and remarkable. The statistics of waiting time may not justify the prediction by the gambler’s fallacy, but paying attention to streaks in the hot hand belief appears to be meaningful in detecting the changes in the underlying process.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
The authors license this article under the terms of the Creative Commons Attribution 3.0 License.
Copyright
Copyright © The Authors [2010] This is an Open Access article, distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Figure 0

Figure 1: Self-overlap within patterns. Pattern (h,h,h,h) overlaps with itself at 3 positions when a copy is shifted to the right end each time by one position, and pattern (h,h,h,t) has no shifted overlap. Overlapped elements are underlined.

Figure 1

Table 1: Mean and variance of the first arrival time, and mean and variance of interarrival times for patterns of length 4 when a fair coin is tossed repeatedly. Reciprocal patterns are listed only once, for example, (h,h,h,t) is equivalent to (t,t,t,h). For non-overlapping patterns such as (h,h,h,t), the two pairs of statistics are identical.

Figure 2

Figure 2: Probabilities of occurrence at least once for patterns (h,h,h,t) and (h,h,h,h) when a fair coin is tossed N times.

Figure 3

Figure 3: Mean time and waiting time as the function of the probability of heads (ph) for patterns (h,h,h,t) and (h,h,h,h). To illustrate the difference in detail, the function is plotted in the range of ph = [0.3, 0.7].

Figure 4

Figure 4: Frequency-Delay ratio as a function of the probability of a head (ph) for patterns (h,h,h,t) and (h,h,h,h). To illustrate the difference in detail, the function is plotted in the range of ph = [0.3, 0.7].

Supplementary material: File

Sun and Wang supplementary material

Sun and Wang supplementary material
Download Sun and Wang supplementary material(File)
File 10.2 KB