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

On the length of the longest head run

Author

Listed:
  • Novak, S.Y.

Abstract

We evaluate the accuracy of approximation to the distribution of the length of the longest head run in a Markov chain with a discrete state space. An estimate of the accuracy of approximation in terms of the total variation distance is established for the first time.

Suggested Citation

  • Novak, S.Y., 2017. "On the length of the longest head run," Statistics & Probability Letters, Elsevier, vol. 130(C), pages 111-114.
    • Handle: RePEc:eee:stapro:v:130:y:2017:i:c:p:111-114
    DOI: 10.1016/j.spl.2017.06.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715217302249
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2017.06.020?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.

    References listed on IDEAS

    as
    1. Vaggelatou, Eutichia, 2003. "On the length of the longest run in a multi-state Markov chain," Statistics & Probability Letters, Elsevier, vol. 62(3), pages 211-221, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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).
    2. Yaakov Malinovsky, 2022. "A Note on the Closed-Form Solution for the Longest Head Run Problem of Abraham de Moivre," The Mathematical Intelligencer, Springer, vol. 44(3), pages 267-268, September.
    3. Tianxiang Ren & Jinwen Wu, 2023. "Percolation Problems on N -Ary Trees," Mathematics, MDPI, vol. 11(11), pages 1-14, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Serkan Eryilmaz, 2005. "On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials," Statistical Papers, Springer, vol. 46(1), pages 117-128, January.
    2. Ghosh, Souvik & Samorodnitsky, Gennady, 2010. "Long strange segments, ruin probabilities and the effect of memory on moving average processes," Stochastic Processes and their Applications, Elsevier, vol. 120(12), pages 2302-2330, December.
    3. EryIlmaz, Serkan, 2008. "Distribution of runs in a sequence of exchangeable multi-state trials," Statistics & Probability Letters, Elsevier, vol. 78(12), pages 1505-1513, September.
    4. George Haiman, 2012. "1-Dependent Stationary Sequences for Some Given Joint Distributions of Two Consecutive Random Variables," Methodology and Computing in Applied Probability, Springer, vol. 14(3), pages 445-458, September.

    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:130:y:2017:i:c:p:111-114. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.