IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v25y2023i4d10.1007_s11009-023-10068-5.html
   My bibliography  Save this article

Distribution of Patterns of Constrained Length in Binary Sequences

Author

Listed:
  • Frosso S. Makri

    (University of Patras)

  • Zaharias M. Psillakis

    (University of Patras)

Abstract

On a finite sequence of binary (0-1) trials we define a random variable enumerating patterns of length subject to certain constraints. For sequences of independent and identically distributed binary trials exact probability mass functions are established in closed forms by means of combinatorial analysis. An explicit expression of the mean value of this random variable is obtained. The results associated with the probability mass functions are extended on sequences of exchangeable binary trials. An application in Information theory concerning counting of a class of run-length-limited binary sequences is provided as a direct byproduct of our study. Illustrative numerical examples exemplify further the results.

Suggested Citation

  • Frosso S. Makri & Zaharias M. Psillakis, 2023. "Distribution of Patterns of Constrained Length in Binary Sequences," Methodology and Computing in Applied Probability, Springer, vol. 25(4), pages 1-15, December.
  • Handle: RePEc:spr:metcap:v:25:y:2023:i:4:d:10.1007_s11009-023-10068-5
    DOI: 10.1007/s11009-023-10068-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-023-10068-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11009-023-10068-5?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. Spiros D. Dafnis & Frosso S. Makri, 2022. "Weak runs in sequences of binary trials," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(5), pages 573-603, July.
    2. Frosso Makri & Zaharias Psillakis, 2013. "Exact distributions of constrained (k, ℓ) strings of failures between subsequent successes," Statistical Papers, Springer, vol. 54(3), pages 783-806, August.
    3. Spiros D. Dafnis & Frosso S. Makri & Markos V. Koutras, 2021. "Generalizations of Runs and Patterns Distributions for Sequences of Binary Trials," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 165-185, March.
    4. Gera, Amos E., 2018. "Simultaneous demonstration tests involving sparse failures," Statistics & Probability Letters, Elsevier, vol. 135(C), pages 26-31.
    5. F.S. Makri & Z.M. Psillakis, 2017. "On Limited Length Binary Strings with an Application in Statistical Control," The Open Statistics and Probability Journal, Bentham Open, vol. 8(1), pages 1-6, February.
    Full references (including those not matched with items on IDEAS)

    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. Spiros D. Dafnis & Frosso S. Makri, 2022. "Weak runs in sequences of binary trials," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(5), pages 573-603, July.
    2. Spiros D. Dafnis & Frosso S. Makri, 2023. "Distributions Related to Weak Runs With a Minimum and a Maximum Number of Successes: A Unified Approach," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-24, March.
    3. Spiros D. Dafnis & Frosso S. Makri & Markos V. Koutras, 2021. "Generalizations of Runs and Patterns Distributions for Sequences of Binary Trials," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 165-185, March.
    4. Arapis, Anastasios N. & Makri, Frosso S. & Psillakis, Zaharias M., 2016. "On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence," Statistics & Probability Letters, Elsevier, vol. 116(C), pages 45-54.
    5. G. Nuel, 2019. "Moments of the Count of a Regular Expression in a Heterogeneous Random Sequence," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 875-887, September.
    6. F.S. Makri & Z.M. Psillakis, 2017. "On Limited Length Binary Strings with an Application in Statistical Control," The Open Statistics and Probability Journal, Bentham Open, vol. 8(1), pages 1-6, February.
    7. Makri, Frosso S. & Psillakis, Zaharias M. & Arapis, Anastasios N., 2015. "Length of the minimum sequence containing repeats of success runs," Statistics & Probability Letters, Elsevier, vol. 96(C), pages 28-37.
    8. Eutichia Vaggelatou, 2024. "On the Longest Run and the Waiting Time for the First Run in a Continuous Time Multi-State Markov Chain," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-26, December.
    9. Fatih Tank & Serkan Eryilmaz, 2015. "The distributions of sum, minima and maxima of generalized geometric random variables," Statistical Papers, Springer, vol. 56(4), pages 1191-1203, November.
    10. Vasileios M. Koutras & Markos V. Koutras & Spiros D. Dafnis, 2022. "A Family of Induced Distributions," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1833-1848, 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:spr:metcap:v:25:y:2023:i:4:d:10.1007_s11009-023-10068-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.