Convergence rate for the longest T-contaminated runs of heads. Paper with detailed proofs
Istv\'an Fazekas, Borb\'ala Fazekas, Michael Ochieng Suja

TL;DR
This paper analyzes the asymptotic behavior and convergence rates of the longest T-contaminated runs of heads in coin tossing, providing improved approximation results and detailed proofs.
Contribution
It introduces new asymptotic distributions and convergence rate improvements for the longest T-contaminated head runs, extending previous results.
Findings
Asymptotic distribution for first hitting time of T-contaminated runs for T=1,2
Limit theorem for the length of the longest T-contaminated run
Enhanced approximation rate for the distribution of the longest run
Abstract
We study the length of -contaminated runs of heads in the well-known coin tossing experiment. A -contaminated run of heads is a sequence of consecutive heads interrupted by tails. For and we find the asymptotic distribution for the first hitting time of the contaminated run of heads having length ; furthermore, we obtain a limit theorem for the length of the longest -contaminated head run. We prove that the rate of the approximation of our accompanying distribution for the length of the longest -contaminated head run is considerably better than the previous ones. For the proof we use a powerful lemma by Cs\'aki, F\"oldes and Koml\'os.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Mathematical Dynamics and Fractals · Analytic Number Theory Research
