Advertisement

Approximations for Discrete Scan Statistics on i.i.d and Markov Dependent Bernoulli Trials

Living reference work entry

Abstract

In this short note, we examine some approximations for the distribution of the discrete scan statistic defined on i.i.d. and Markov-dependent Bernoulli trials. The approximations are developed using the finite Markov chain imbedding technique of Fu and Koutras (J Am Stat Assoc 89(427):1050–1058, 1994) and the methods in Fu and Johnson (Adv Appl Probab 41(1):292–308, 2009) and Koutras and Milienos (J Stat Plann Inference 142(6):1464–1479, 2012). The approximations perform well for the cases considered and, in most cases, outperform the commonly used product approximation developed in Chen and Glaz (Approximations for the distribution and the moments of discrete scan statistics. In: Glaz J, Balakrishnan N (eds) Scan statistics and applications. Statistics for industry and technology. Birkhäuser, Boston, pp 27–66, 1999).

Keywords

Discrete scan statistic Finite Markov chain imbedding Approximations Bernoulli trials Markov dependent 

References

  1. Aho AV, Sethi R, Ullmann JD (1985) Compilers, principles, techniques, and tools. Addison–Wesley, ReadingGoogle Scholar
  2. Chen J, Glaz J (1999) Approximations for the distribution and the moments of discrete scan statistics. In: Glaz J, Balakrishnan N (eds) Scan statistics and applications. Statistics for industry and technology. Birkhäuser, Boston, pp 27–66CrossRefGoogle Scholar
  3. Fu JC (2001) Distribution of the scan statistic for a sequence of bistate trials. J Appl Probab 38(4):908–916MathSciNetCrossRefMATHGoogle Scholar
  4. Fu JC, Johnson BC (2009) Approximate probabilities for runs and patterns in i.i.d. and Markov dependent multi-state trials. Adv Appl Probab 41(1):292–308MathSciNetCrossRefMATHGoogle Scholar
  5. Fu JC, Koutras MV (1994) Distribution theory of runs: a Markov chain approach. J Am Stat Assoc 89(427):1050–1058MathSciNetCrossRefMATHGoogle Scholar
  6. Fu JC, Lou WYW (2003) Distribution theory of runs and patterns and its applications. World Scientific Publishing Co. Inc, River EdgeCrossRefMATHGoogle Scholar
  7. Glaz J, Balakrishnan N, Glaz J (1999) Scan statistics and applications. Statistics for industry and technology. Birkhäuser, BostonCrossRefMATHGoogle Scholar
  8. Glaz J, Pozdnyakov V, Wallenstein S (eds) (2009) Scan statistics: methods and applications. Statistics for industry and technology. Birkhäuser, BostonMATHGoogle Scholar
  9. Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison–Wesley, ReadingMATHGoogle Scholar
  10. Johnson BC, Fu JC (2014) Approximating the distributions of runs and patterns. J Stat Distrib Appl 1(1):5CrossRefMATHGoogle Scholar
  11. Koutras M, Alexandrou V (1995) Runs, scans and URN model distributions: a unified Markov chain approach. Ann Inst Stat Math 47(4):743–766MathSciNetCrossRefMATHGoogle Scholar
  12. Koutras M, Milienos F (2012) Exact and asymptotic results for pattern waiting times. J Stat Plann Inference 142(6):1464–1479MathSciNetCrossRefMATHGoogle Scholar
  13. Naus J (1974) Probabilities for a generalized birthday problem. J Am Stat Assoc 69(347):810–815MathSciNetCrossRefMATHGoogle Scholar
  14. Nicodème P, Salvy B, Flajolet P (2002) Motif statistics. Theor Comput Sci 287:593–617MathSciNetCrossRefMATHGoogle Scholar
  15. Seneta E (1981) Non-negative matrices and Markov chains, 2nd edn. Springer, New YorkCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media LLC 2018

Authors and Affiliations

  1. 1.University of ManitobaWinnipegCanada

Section editors and affiliations

  • Joseph Glaz
    • 1
  • Markos V. Koutras
    • 2
  1. 1.Department of StatisticsUniversity of ConnecticutStorrsUSA
  2. 2.Dept. of Statistics and Insurance Science, University of PiraeusPiraeusGreece

Personalised recommendations