Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-13T05:55:50.656Z Has data issue: false hasContentIssue false

On the occurrence of composite events and clusters of points

Published online by Cambridge University Press:  14 July 2016

Valeri T. Stefanov*
Affiliation:
The University of Western Australia
*
Postal address: Department of Mathematics and Statistics, The University of Western Australia, Nedlands, WA 6907, Australia. Email address: stefanov@maths.uwa.edu.au.

Abstract

We derive explicit closed expressions for the moment generating functions of whole collections of quantities associated with the waiting time till the occurrence of composite events in either discrete or continuous-time models. The discrete-time models are independent, or Markov-dependent, binary trials and the events of interest are collections of successes with the property that each two consecutive successes are separated by no more than a fixed number of failures. The continuous-time models are renewal processes and the relevant events are clusters of points. We provide a unifying technology for treating both the discrete and continuous-time cases. This is based on first embedding the problems into similar ones for suitably selected Markov chains or Markov renewal processes, and second, applying tools from the exponential family technology.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Barndorff-Nielsen, O. (1978). Information and Exponential Families. Wiley, Chichester, UK.Google Scholar
Barndorff-Nielsen, O. (1980). Conditionality resolutions. Biometrika 67, 293310.CrossRefGoogle Scholar
Brown, L. (1986). Fundamentals of Statistical Exponential Families. IMS, Hayward, CA.Google Scholar
Gihman, I. I., and Skorohod, A. V. (1974). The Theory of Stochastic Processes, Vol. 1. Springer, Berlin.Google Scholar
Hall, P. (1988). Introduction to the Theory of Coverage Processes. Wiley, New York.Google Scholar
Koutras, M. V. (1996). On a waiting time distribution in a sequence of Bernoulli trials. Ann. Inst. Statist. Math. 48, 789806.CrossRefGoogle Scholar
Koutras, M. V., and Alexandrou, V. A. (1995). Runs, scans and urn model distributions: a unified Markov chain approach. Ann. Inst. Statist. Math. 47, 743766.CrossRefGoogle Scholar
Leslie, R. T. (1967). Recurrent composite events. J. Appl. Prob. 4, 3464.CrossRefGoogle Scholar
Leslie, R. T. (1969). Recurrence times of clusters of Poisson points. J. Appl. Prob. 6, 372388.CrossRefGoogle Scholar
Mood, A. M. (1940). The distribution theory of runs. Ann. Math. Statist. 11, 367392.CrossRefGoogle Scholar
Naus, J. (1979). An indexed bibliography of clusters, clumps and coincidences. Int. Statist. Rev. 47, 4778.Google Scholar
Roach, S. A. (1968). The Theory of Random Clumping. Methuen, London.Google Scholar
Stefanov, V. T. (1991). Noncurved exponential families associated with observations over finite state Markov chains. Scand. J. Statist. 18, 353356.Google Scholar
Stefanov, V. T. (1995). Explicit limit results for minimal sufficient statistics and maximum likelihood estimators in some Markov processes: exponential families approach. Ann. Statist. 23, 10731101.CrossRefGoogle Scholar
Stefanov, V. T. (1997). On the occurrence of composite events and clusters of points. Research Report 27, Department of Mathematics, The University of Western Australia.Google Scholar
Stefanov, V. T., and Pakes, A. G. (1997). Explicit distributional results in pattern formation. Ann. Appl. Prob. 7, 666678.Google Scholar