Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-24T07:46:14.223Z Has data issue: false hasContentIssue false

On the asymptotic distribution of the discrete scan statistic

Published online by Cambridge University Press:  14 July 2016

Michael V. Boutsikas*
Affiliation:
University of Piraeus
Markos V. Koutras*
Affiliation:
University of Piraeus
*
Postal address: Department of Statistics and Insurance Science, University of Piraeus, 80 Karaoli and Dimitriou Street, 185 34 Piraeus, Greece.
Postal address: Department of Statistics and Insurance Science, University of Piraeus, 80 Karaoli and Dimitriou Street, 185 34 Piraeus, Greece.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The discrete scan statistic in a binary (0-1) sequence of n trials is defined as the maximum number of successes within any k consecutive trials (n and k, nk, being two positive integers). It has been used in many areas of science (quality control, molecular biology, psychology, etc.) to test the null hypothesis of uniformity against a clustering alternative. In this article we provide a compound Poisson approximation and subsequently use it to establish asymptotic results for the distribution of the discrete scan statistic as n, k → ∞ and the success probability of the trials is kept fixed. An extreme value theorem is also provided for the celebrated Erdős-Rényi statistic.

Type
Research Papers
Copyright
© Applied Probability Trust 2006 

References

Balakrishnan, N. and Koutras, M. V. (2002). Runs and Scans with Applications. John Wiley, Chichester.Google Scholar
Barbour, A. D. and Chryssaphinou, O. (2001). Compound Poisson approximation: a user's guide. Ann. Appl. Prob. 11, 9641002.Google Scholar
Boutsikas, M. V. and Koutras, M. V. (2001). Compound Poisson approximation for sums of dependent random variables. In Probability and Statistical Models with Applications, eds Charalambides, C. A., Koutras, M. V. and Balakrishnan, N., Chapman and Hall/CRC Press, Boca Raton, FL, pp. 6386.Google Scholar
Boutsikas, M. V. and Koutras, M. V. (2002). Modeling claim exceedances over thresholds. Insurance Math. Econom. 30, 6783.Google Scholar
Deheuvels, P. and Devroye, L. (1987). Limit laws of Erdős–Rényi–Shepp type. Ann. Prob. 15, 13631386.Google Scholar
Erdős, P. and Rényi, A. (1970). On a new law of large numbers. J. Anal. Math. 23, 103111.Google Scholar
Fu, J. C. (2001). Distribution of the scan statistic for a sequence of bistate trials. J. Appl. Prob. 38, 908916.Google Scholar
Fu, J. C. and Lou, W. Y. W. (2003). Distribution Theory of Runs and Patterns and Its Applications. A Finite Markov Chain Imbedding Approach. World Scientific, Singapore.Google Scholar
Glaz, J. and Balakrishnan, N. (eds) (1999). Scan Statistics and Applications. Birkhäuser, Boston, MA.Google Scholar
Glaz, J. and Naus, J. I. (1991). Tight bounds and approximations for scan statistic probabilities for discrete data. Ann. Appl. Prob. 1, 306318.Google Scholar
Glaz, J. and Zhang, Z. (2004). Multiple window discrete scan statistics. J. Appl. Stat. 31, 967980.Google Scholar
Glaz, J., Naus, J. and Wallenstein, S. (2001). Scan Statistics. Springer, New York.Google Scholar
Höglund, T. (1979). A unified formulation of the central limit theorem for small and large deviations from the mean. Z. Wahrscheinlichkeitsth. 49, 105117.Google Scholar
Petrov, V. V. (1965). On the probabilities of large deviations for sums of random variables. Theory Prob. Appl. 10, 287298.Google Scholar
Roos, M. (1994). Stein's method for compound Poisson approximation: the local approach. Ann. Appl. Prob. 4, 11771187.Google Scholar