Abstract
We show how martingale techniques (both old and new) can be used to obtain otherwise hard-to-get information for the moments and distributions of waiting times for patterns in independent or Markov sequences. In particular, we show how these methods provide moments and distribution approximations for certain scan statistics, including variable length scan statistics. Each general problem that is considered is also illustrated with a concrete example confirming the computational tractability of the method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aldous, D. (1989). Probability Approximations via the Poisson Clumping Heuristic, Springer Publishing, New York.
Fu, J.C. and Chang, Y. (2002). On probability generating functions for waiting time distribution of compound patterns in a sequence of multistate trials, Journal of Applied Probability, 39, 70–80.
Fu, J.C. and Lou, W.Y.W. (2006). Waiting time distributions of simple and compound patterns in a sequence of r-th order Markov dependent multi-state trials, Annals of the Institute of Statistical Mathematics, 58, 291–310.
Gerber, H. and Li, S. (1981). The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain, Stochastic Processes and Their Applications, 11, 101–108.
Glaz, J., Kulldorff, M., Pozdnyakov, V. and Steele, J.M. (2006). Gambling teams and waiting times for patterns in two-state Markov chains, Journal of Applied Probability, 43, 127–140.
Glaz, J. and Naus, J.I. (1991). Tight bounds for scan statistics probabilities for discrete data, Annals of Applied Probability, 1, 306–318.
Glaz, J., Naus, J.I. and Wallenstein, S. (2001). Scan Statistics, Springer, New York.
Glaz, J. and Zhang, Z. (2006). Maximum scan score-type statistics, Statistics and Probability Letters, 76, 1316–1322.
Li, S. (1980). A martingale approach to the study of occurrence of sequence patterns in repeated experiments, The Annals of Probability, 8, 1171–1176.
Naus, J.I. (1965). The distribution of the size of the maximum cluster of points on a line, Journal of The American Statistical Association, 60, 532–538.
Naus, J.I. and Stefanov, V.T. (2002). Double-scan statistics, Methodology and Computing in Applied Probability, 4, 163–180.
Naus, J.I. and Wartenberg, D. A. (1997). A double-scan statistic for clusters of two types of events, Journal of The American Statistical Association, 92, 1105–1113.
Pozdnyakov, V. (2008). On occurrence of patterns in Markov chains: method of gambling teams, to appear in Statistics and Probability Letters.
Pozdnyakov, V., Glaz, J., Kulldorff, M. and Steele, J.M. (2005). A martingale approach to scan statistics, Annals of The Institute of Statistical Mathematics, 57, 21–37.
Pozdnyakov, V. and Kulldorff, M. (2006). Waiting times for patterns and a method of gambling teams, The American Mathematical Monthly, 113, 134–143.
Shiryaev, A.N. (1995). Probability, Springer, New York.
Williams, D. (1991). Probability with Martingales, Cambridge University Press, Cambridge.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Pozdnyakov, V., Steele, J.M. (2009). Martingale Methods for Patterns and Scan Statistics. In: Glaz, J., Pozdnyakov, V., Wallenstein, S. (eds) Scan Statistics. Statistics for Industry and Technology. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4749-0_14
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4749-0_14
Published:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4748-3
Online ISBN: 978-0-8176-4749-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)