An extreme value theory for long head runs (Q1072220): Difference between revisions

For an infinite sequence of independent coin tosses with \(P(heads)=p\in (0,1)\), the longest run of consecutive heads in the first n tosses is a natural object of study. We show that the probabilistic behavior of the length of the longest pure head run is closely approximated by that of the greatest integer function of the maximum of n(1-p) i.i.d. exponential random variables. These results are extended to the case of the longest head run interrupted by k tails. The mean length of this run is shown to be \[ \log (n)+k \log \log (n)+(k+1)\log (1-p)-\log (k!)+k+\gamma /\lambda - 1/2+r_ 1(n)+o(1) \] where \(\log =\log_{1/p}\), \(\gamma =0.577..\). is the Euler-Mascheroni constant, \(\lambda =\ln (1/p)\), and \(r_ 1(n)\) is small. The variance is \(\pi^ 2/6\lambda^ 2+1/12+r_ 2(n)+o(1),\) where \(r_ 2(n)\) is again small. Upper and lower class results for these run lengths are also obtained and extensions discussed.