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

Minimum and maximum distances between failures in binary sequences

Author

Listed:
  • Makri, Frosso S.

Abstract

The minimum and maximum distances denoting the extreme numbers of successes between two successive failures in binary sequences, are considered. Exact marginal and joint probability distributions of these statistics are obtained via combinatorial analysis. Applications related to urn models and system reliability are studied and clarify further the theoretical results.

Suggested Citation

  • Makri, Frosso S., 2011. "Minimum and maximum distances between failures in binary sequences," Statistics & Probability Letters, Elsevier, vol. 81(3), pages 402-410, March.
    • Handle: RePEc:eee:stapro:v:81:y:2011:i:3:p:402-410
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(10)00339-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. M. Koutras, 1996. "On a waiting time distribution in a sequence of Bernoulli trials," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 48(4), pages 789-806, December.
    2. Eryilmaz, Serkan & Kan, Cihangir & Akici, Fatih, 2009. "Consecutive k-within-m-out-of-n:F system with exchangeable components," MPRA Paper 26838, University Library of Munich, Germany.
    3. Anish Sarkar & Kanwar Sen & Anuradha, 2004. "Waiting time distributions of runs in higher order Markov chains," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 56(2), pages 317-349, June.
    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. 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.
    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.

    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. Koutras, Vasileios M. & Koutras, Markos V. & Yalcin, Femin, 2016. "A simple compound scan statistic useful for modeling insurance and risk management problems," Insurance: Mathematics and Economics, Elsevier, vol. 69(C), pages 202-209.
    2. Serkan Eryilmaz, 2013. "Component importance for linear consecutive‐ k ‐Out‐of‐ n and m ‐Consecutive‐ k ‐Out‐of‐ n systems with exchangeable components," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 313-320, June.
    3. Eryilmaz, Serkan, 2011. "The behavior of warm standby components with respect to a coherent system," Statistics & Probability Letters, Elsevier, vol. 81(8), pages 1319-1325, August.
    4. Serkan Eryilmaz & Markos V. Koutras & Ioannis S. Triantafyllou, 2011. "Signature based analysis of m‐Consecutive‐k‐out‐of‐n: F systems with exchangeable components," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(4), pages 344-354, June.
    5. 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.
    6. Jia, Xujie & Shen, Jingyuan & Xu, Fanqi & Ma, Ruihong & Song, Xueying, 2019. "Modular decomposition signature for systems with sequential failure effect," Reliability Engineering and System Safety, Elsevier, vol. 189(C), pages 435-444.
    7. Gera, Amos E., 2018. "Simultaneous demonstration tests involving sparse failures," Statistics & Probability Letters, Elsevier, vol. 135(C), pages 26-31.
    8. Villén-Altamirano, José, 2010. "RESTART simulation of non-Markov consecutive-k-out-of-n: F repairable systems," Reliability Engineering and System Safety, Elsevier, vol. 95(3), pages 247-254.
    9. 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.
    10. Kiyoshi Inoue & Sigeo Aki, 2003. "Generalized binomial and negative binomial distributions of orderk by thel-overlapping enumeration scheme," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 55(1), pages 153-167, March.
    11. Anish Sarkar & Kanwar Sen & Anuradha, 2004. "Waiting time distributions of runs in higher order Markov chains," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 56(2), pages 317-349, June.
    12. E. Salehi & M. Asadi & S. Eryılmaz, 2012. "On the mean residual lifetime of consecutive k-out-of-n systems," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 93-115, March.
    13. Eryilmaz, Serkan, 2011. "Estimation in coherent reliability systems through copulas," Reliability Engineering and System Safety, Elsevier, vol. 96(5), pages 564-568.
    14. Spiros Dafnis & Andreas Philippou & Demetrios Antzoulakos, 2012. "Distributions of patterns of two successes separated by a string of k-2 failures," Statistical Papers, Springer, vol. 53(2), pages 323-344, May.
    15. N. Balakrishnan & P. Chan, 2000. "Start-Up Demonstration Tests with Rejection of Units upon Observing d Failures," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 52(1), pages 184-196, March.
    16. Antzoulakos, Demetrios L. & Boutsikas, Michael V., 2007. "A direct method to obtain the joint distribution of successes, failures and patterns in enumeration problems," Statistics & Probability Letters, Elsevier, vol. 77(1), pages 32-39, January.
    17. 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.
    18. Kim, Sungsu & Park, Chongjin & Oh, Jungtaek, 2013. "On waiting time distribution of runs of ones or zeros in a Bernoulli sequence," Statistics & Probability Letters, Elsevier, vol. 83(1), pages 339-344.

    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:81:y:2011:i:3:p:402-410. 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.