Hostname: page-component-7dd5485656-glrdx Total loading time: 0 Render date: 2025-10-31T09:37:02.087Z Has data issue: false hasContentIssue false
  • English
  • Français

Runs on a circle

Part of: Limit theorems Distribution theory Markov processes

Published online by Cambridge University Press:  14 July 2016

M. V. Koutras ,
G. K. Papadopoulos  and
S. G. Papastavridis
M. V. Koutras*
Affiliation:
University of Athens
G. K. Papadopoulos*
Affiliation:
University of Athens
S. G. Papastavridis*
Affiliation:
University of Athens
*
∗ Postal address for all authors: Department of Mathematics, University of Athens, Panepistemiopolis, 15784 Athens, Greece.
∗ Postal address for all authors: Department of Mathematics, University of Athens, Panepistemiopolis, 15784 Athens, Greece.
∗ Postal address for all authors: Department of Mathematics, University of Athens, Panepistemiopolis, 15784 Athens, Greece.
Get access Rights & Permissions [Opens in a new window]

Abstract

In the present paper we study the number of occurrences of non-overlapping success runs of length in a sequence of (not necessarily identical) Bernoulli trials arranged on a circle. An exact formula is given for the probability function, along with some sharp bounds which turn out to be very useful in establishing limiting (Poisson convergence) results. Certain applications to statistical run tests and reliability theory are also discussed.

Keywords

CIRCULAR SUCCESS RUNSBERNOULLI TRIALSMARKOV CHAINSCHEN–STEIN METHODPOISSON CONVERGENCEBINOMIAL DISTRIBUTIONS OF ORDER k

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 62E15: Exact distribution theory 62E17: Approximations to distributions (nonasymptotic) 60F99: None of the above, but in this section

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 32 , Issue 2 , June 1995 , pp. 396 - 404
Copyright
Copyright © Applied Probability Trust 1995 

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.)

Article purchase

Temporarily unavailable

References

Agin, M. A. and Godbole, A. P. (1992) A new exact runs test for randomness. In Computing Science and Statistics, eds. Page, C. and LePage, R., Proceedings of the 22nd Symposium on the Interface, pp. 281–285. Springer-Verlag, New York.Google Scholar
Aki, S., Kuboki, H. and Hirano, K. (1984) On discrete distributions of order k. Ann. Inst. Statist. Math. 36, 431–440.Google Scholar
Alevizos, P. D., Papastavridis, S. G. and Sypsas, P. (1993) Reliability of cyclic m-consecutive-k-out-of-n: F systems. Reliability Quality Control and Risk Assessment, Proc. IASTED Conference, 140–143.Google Scholar
Arratia, R., Goldstein, L. and Gordon, L. (1989) Two moments suffice for Poisson approximations: the Chen–Stein method. Ann. Prob. 17, 9–25.Google Scholar
Asano, C. (1965) Run test for a circular distribution and a table of probabilities. Ann. Inst. Statist. Math. 17, 331–346.CrossRefGoogle Scholar
Barbour, A. D., Holst, L. and Janson, S. (1992) Poisson Approximation. Oxford University Press.CrossRefGoogle Scholar
Barton, D. E. and David, F. N. (1958) Runs in a ring. Biometrika 45, 572–578.CrossRefGoogle Scholar
Chao, M. T., Fu, J. C. and Koutras, M. V. (1995) A survey of the reliability studies of consecutivek-out-of-n: F systems and its related systems. IEEE Trans. Reliability 44. To appear.Google Scholar
Esary, J. D., Proschan, F. and Walkup, D. W. (1967) Association of random variables, with applications. Ann. Math. Statist. 38, 1466–1474.CrossRefGoogle Scholar
Feller, W. (1968) An Introduction to Probability Theory and Its Applications. Vol. I, 3rd edn. Wiley, New York.Google Scholar
Fu, J. C. (1993) Poisson convergence in reliability of a large linearly connected system as related to coin tossing. Statist. Sinica 3, 261–275.Google Scholar
Fu, J. C. and Koutras, M. V. (1994) Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050–1058.Google Scholar
Gibbons, J. D. (1971) Nonparametric Statistical Inference. McGraw-Hill, New York.Google Scholar
Godbole, A. P. (1991) Poisson approximations for runs and patterns of rare events. Adv. Appl. Prob. 23, 851–865.Google Scholar
Hirano, K., Aki, S., Kashiwagi, N. and Kuboki, H. (1991) On Ling's binomial and negative binomial distributions of order k. Statist. Prob. Lett. 11, 503–509.CrossRefGoogle Scholar
Makri, F. S. and Philippou, A. N. (1994) Binomial distributions of order k on the circle. In Runs and Patterns in Probability: Selected Papers, ed. Godbole, A. and Papastavridis, S., pp. 65–81. Kluwer, Dordrecht.CrossRefGoogle Scholar
Papastavridis, S. G. (1990) m-consecutive-k-out-of-n: F system. IEEE Trans. Reliability 39, 386–388.Google Scholar
Papastavridis, S. G. and Koutras, M. V. (1993) Consecutive-k-out-of-n systems. In New Trends in System Reliability Evaluation, ed. Misra, K. B., pp. 228–248. Elsevier, Amsterdam.CrossRefGoogle Scholar
Prairie, R. P., Zimmer, W. J. and Brookhouse, J. K. (1962) Some acceptance sampling plans based on the theory of runs. Technometrics 4, 177–185.CrossRefGoogle Scholar