IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v208y2024ics0167715224000282.html
   My bibliography  Save this article

Convergence rate for the longest T-contaminated runs of heads

Author

Listed:
  • Fazekas, István
  • Fazekas, Borbála
  • Suja, Michael Ochieng

Abstract

We study the length of T-contaminated runs of heads in the well-known coin tossing experiment. A T-contaminated run of heads is a sequence of consecutive heads interrupted by T tails. For T=1 and T=2 we find the asymptotic distribution for the first hitting time of the T contaminated run of heads having length m; furthermore, we obtain a limit theorem for the length of the longest T-contaminated head run. We find the rate of the approximation of our accompanying distribution for the length of the longest T-contaminated head run. For the proof we use a powerful lemma of Csáki et al. (1987).

Suggested Citation

  • Fazekas, István & Fazekas, Borbála & Suja, Michael Ochieng, 2024. "Convergence rate for the longest T-contaminated runs of heads," Statistics & Probability Letters, Elsevier, vol. 208(C).
    • Handle: RePEc:eee:stapro:v:208:y:2024:i:c:s0167715224000282
    DOI: 10.1016/j.spl.2024.110059
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715224000282
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2024.110059?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:208:y:2024:i:c:s0167715224000282. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.