IDEAS home Printed from https://ideas.repec.org/a/spr/aistmt/v70y2018i5d10.1007_s10463-017-0621-1.html
   My bibliography  Save this article

Asymptotic results for jump probabilities associated to the multiple scan statistic

Author

Listed:
  • Markos V. Koutras

    (University of Piraeus)

  • Demetrios P. Lyberopoulos

    (University of Piraeus)

Abstract

The concept of pattern arises in many applications comprising experimental trials with two or more possible outcomes in each trial. A binary scan of type r / k is a special pattern referring to success–failure strings of fixed length k that contain at least r-successes, where r, k are positive integers with $$r\le k$$ r ≤ k . The multiple scan statistic $$W_{t,k,r}$$ W t , k , r is defined as the enumerating random variable for the overlapping moving windows occurring until trial t which include a scan of type r / k. In the present work, we consider a sequence of independent binary trials with not necessarily equal probabilities of success and develop upper bounds for the probability of the event that the multiple scan statistic will perform a jump from $$\ell $$ ℓ to $$\ell +1$$ ℓ + 1 (where $$\ell $$ ℓ is a nonnegative integer) in a finite time horizon.

Suggested Citation

  • Markos V. Koutras & Demetrios P. Lyberopoulos, 2018. "Asymptotic results for jump probabilities associated to the multiple scan statistic," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 70(5), pages 951-968, October.
    • Handle: RePEc:spr:aistmt:v:70:y:2018:i:5:d:10.1007_s10463-017-0621-1
    DOI: 10.1007/s10463-017-0621-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10463-017-0621-1
    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/s10463-017-0621-1?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. Chen, Jie & Glaz, Joseph, 1996. "Two-dimensional discrete scan statistics," Statistics & Probability Letters, Elsevier, vol. 31(1), pages 59-68, December.
    2. Joseph I. Naus & Sylvan Wallenstein, 2004. "Multiple Window and Cluster Size Scan Procedures," Methodology and Computing in Applied Probability, Springer, vol. 6(4), pages 389-400, December.
    3. Yu-Fei Hsieh & Tung-Lung Wu, 2013. "Recursive equations in finite Markov chain imbedding," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 65(3), pages 513-527, June.
    4. Vladimir Pozdnyakov & Joseph Glaz & Martin Kulldorff & J. Steele, 2005. "A martingale approach to scan statistics," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 57(1), pages 21-37, March.
    5. Kiyoshi Inoue & Sigeo Aki, 2009. "On waiting time distributions associated with compound patterns in a sequence of multi-state trials," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 61(2), pages 499-516, June.
    6. Boutsikas, M. V. & Koutras, M. V., 2002. "Modeling claim exceedances over thresholds," Insurance: Mathematics and Economics, Elsevier, vol. 30(1), pages 67-83, February.
    7. M. Koutras & V. Alexandrou, 1995. "Runs, scans and URN model distributions: A unified Markov chain approach," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 47(4), pages 743-766, December.
    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. Yi-Shen Lin & Xenos Chang-Shuo Lin & Daniel Wei-Chung Miao & Yi-Ching Yao, 2020. "Corrected Discrete Approximations for Multiple Window Scan Statistics of One-Dimensional Poisson Processes," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 237-265, March.
    2. Boutsikas V. Michael & Vaggelatou Eutichia, 2020. "On the Distribution of the Number of Success Runs in a Continuous Time Markov Chain," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 969-993, September.
    3. 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.
    4. Wu, Tung-Lung & Glaz, Joseph, 2015. "A new adaptive procedure for multiple window scan statistics," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 164-172.
    5. Stathis Chadjiconstantinidis & Serkan Eryilmaz, 2023. "Computing waiting time probabilities related to $$ (k_{1},k_{2},\ldots ,k_{l})$$ ( k 1 , k 2 , … , k l ) pattern," Statistical Papers, Springer, vol. 64(5), pages 1373-1390, October.
    6. Kiyoshi Inoue & Sigeo Aki, 2013. "Distributions of numbers of runs and scans on directed acyclic graphs with generation," Computational Statistics, Springer, vol. 28(3), pages 1133-1150, June.
    7. Guenther Walther & Andrew Perry, 2022. "Calibrating the scan statistic: Finite sample performance versus asymptotics," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(5), pages 1608-1639, November.
    8. Sankaran, P.G. & Midhu, N.N., 2010. "On waiting time distributions for patterns in a sequence of multistate trials," Statistics & Probability Letters, Elsevier, vol. 80(23-24), pages 1798-1805, December.
    9. Yong Kong, 2019. "Decoupling Combinatorial Complexity: a Two-Step Approach to Distributions of Runs," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 789-803, September.
    10. Carey E. Priebe & John M. Conroy & David J. Marchette & Youngser Park, 2005. "Scan Statistics on Enron Graphs," Computational and Mathematical Organization Theory, Springer, vol. 11(3), pages 229-247, October.
    11. Yi, He & Balakrishnan, Narayanaswamy & Li, Xiang, 2023. "Reliability of three-dimensional consecutive k-type systems," Reliability Engineering and System Safety, Elsevier, vol. 233(C).
    12. 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.
    13. Joseph Glaz & Marco Guerriero & Rohini Sen, 2010. "Approximations for a Three Dimensional Scan Statistic," Methodology and Computing in Applied Probability, Springer, vol. 12(4), pages 731-747, December.
    14. A. Godbole & M. Koutras & F. Milienos, 2011. "Binary consecutive covering arrays," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 63(3), pages 559-584, June.
    15. Zajkowski, Krzysztof, 2014. "A note on the gambling team method," Statistics & Probability Letters, Elsevier, vol. 85(C), pages 45-50.
    16. Chen, Jie & Glaz, Joseph, 2002. "Approximations for a conditional two-dimensional scan statistic," Statistics & Probability Letters, Elsevier, vol. 58(3), pages 287-296, July.
    17. Michael V. Boutsikas & Markos V. Koutras, 2000. "Reliability Approximation for Markov Chain Imbeddable Systems," Methodology and Computing in Applied Probability, Springer, vol. 2(4), pages 393-411, December.
    18. 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.
    19. 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.
    20. Bartolucci, F., 2001. "Developments of the Markov chain approach within the distribution theory of runs," Computational Statistics & Data Analysis, Elsevier, vol. 36(1), pages 107-118, March.

    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:aistmt:v:70:y:2018:i:5:d:10.1007_s10463-017-0621-1. 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.