On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads
In this paper, we study the usual coin tossing experiment. We call a run at most <i>T</i>-contaminated, if it contains at most <i>T</i> tails. We approximate the distribution of the length of the longest at most <i>T</i>-contaminated runs. We offer a more precise...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/27/1/33 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832588593484267520 |
|---|---|
| author | István Fazekas Borbála Fazekas László Fórián |
| author_facet | István Fazekas Borbála Fazekas László Fórián |
| author_sort | István Fazekas |
| collection | DOAJ |
| description | In this paper, we study the usual coin tossing experiment. We call a run at most <i>T</i>-contaminated, if it contains at most <i>T</i> tails. We approximate the distribution of the length of the longest at most <i>T</i>-contaminated runs. We offer a more precise approximation than the previous one. |
| format | Article |
| id | doaj-art-f58e1649b50e4704816302eff2ed607c |
| institution | Kabale University |
| issn | 1099-4300 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Entropy |
| spelling | doaj-art-f58e1649b50e4704816302eff2ed607c2025-01-24T13:31:45ZengMDPI AGEntropy1099-43002025-01-012713310.3390/e27010033On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of HeadsIstván Fazekas0Borbála Fazekas1László Fórián2Faculty of Informatics, University of Debrecen, Kassai Street 26, 4028 Debrecen, HungaryInstitute of Mathematics, University of Debrecen, Egyetem Square 1, 4032 Debrecen, HungaryFaculty of Informatics, University of Debrecen, Kassai Street 26, 4028 Debrecen, HungaryIn this paper, we study the usual coin tossing experiment. We call a run at most <i>T</i>-contaminated, if it contains at most <i>T</i> tails. We approximate the distribution of the length of the longest at most <i>T</i>-contaminated runs. We offer a more precise approximation than the previous one.https://www.mdpi.com/1099-4300/27/1/33coin tossinglongest head runasymptotic distributionrate of convergence |
| spellingShingle | István Fazekas Borbála Fazekas László Fórián On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads Entropy coin tossing longest head run asymptotic distribution rate of convergence |
| title | On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads |
| title_full | On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads |
| title_fullStr | On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads |
| title_full_unstemmed | On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads |
| title_short | On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads |
| title_sort | on the convergence rate for the longest at most i t i contaminated runs of heads |
| topic | coin tossing longest head run asymptotic distribution rate of convergence |
| url | https://www.mdpi.com/1099-4300/27/1/33 |
| work_keys_str_mv | AT istvanfazekas ontheconvergencerateforthelongestatmostiticontaminatedrunsofheads AT borbalafazekas ontheconvergencerateforthelongestatmostiticontaminatedrunsofheads AT laszloforian ontheconvergencerateforthelongestatmostiticontaminatedrunsofheads |