Note on a clustering problem

B. Saperstein

doi:10.2307/3212882

Abstract

Consider the clustering statistic, k* defined to be the maximum number of 1's to appear within any m consecutive positions in a random arrangement of a 1's and M–a 0's. Pr(k* – k) was found for the case k ≧ ½ a by the author [4], and then for m/M = 1/L, L an integer, by Naus [3]. Here, we generalise Naus's method to obtain the distribution of k* under no special restrictions on a, k, m or M.

References

[1] Hwang, F. K. (1974) A discrete clustering problem. Unpublished memorandum.Google Scholar

[2] Karlin, S. and Mcgregor, J. (1959) Coincidence probabilities. Pacific J. Math. 9, 1141–1164.CrossRef Google Scholar

[3] Naus, J. I. (1974) Probabilities for a generalized birthday problem. J. Amer. Statist. Assoc. 69, 810–815.CrossRef Google Scholar

[4] Saperstein, B. (1974) The generalized birthday problem. J. Amer. Statist. Assoc. 67, 425–428.CrossRef Google Scholar

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Glaz, J 1979. The number of dense arrangements. Journal of Combinatorial Theory, Series A, Vol. 27, Issue. 3, p. 367.

Guibas, L.J and Odlyzko, A.M 1981. String overlaps, pattern matching, and nontransitive games. Journal of Combinatorial Theory, Series A, Vol. 30, Issue. 2, p. 183.

Samuel-Cahn, Ester 1983. Simple approximations to the expected waiting time for a cluster of any given size, for point processes. Advances in Applied Probability, Vol. 15, Issue. 1, p. 21.

Papastavridis, Stavros G. 1988. A weibull limit for the reliability of a consecutive k-within-m-out-of-n system. Advances in Applied Probability, Vol. 20, Issue. 3, p. 690.

Papastavridis, S.G. and Sfakianakis, M.E. 1991. Optimal-arrangement and importance of the components in a consecutive-k-out-of-r-from-n:F system. IEEE Transactions on Reliability, Vol. 40, Issue. 3, p. 277.

Sfakianakis, M. Kounias, S. and Hillaris, A. 1992. Reliability of a consecutive k-out-of-r-from-n:F system. IEEE Transactions on Reliability, Vol. 41, Issue. 3, p. 442.

Papastavridis, S.G. and Koutras, M.V. 1993. Bounds for reliability of consecutive k-within-m-out-of-n:F systems. IEEE Transactions on Reliability, Vol. 42, Issue. 1, p. 156.

Sfakianakis, Michael 1993. Optimal arrangement of components in a consecutive k-out-of-r-from n:F system. Microelectronics Reliability, Vol. 33, Issue. 10, p. 1573.

Papastavridis, Stavros G. and Koutras, Markos V. 1993. New Trends in System Reliability Evaluation. Vol. 16, Issue. , p. 228.

Preuss, Wolfgang W. and Boehme, Thomas K. 1994. Approximation, Probability, and Related Fields. p. 401.

Griffith, William S. 1994. Runs and Patterns in Probability. p. 173.

Jun Cai 1994. Reliability of a large consecutive-k-out-of-r-from-n:F system with unequal component-reliability. IEEE Transactions on Reliability, Vol. 43, Issue. 1, p. 107.

Koutras, M. V. Papadopoulos, G. K. and Papastavridis, S. G. 1994. Note: Pairwise rearrangements in reliability structures. Naval Research Logistics, Vol. 41, Issue. 5, p. 683.

Koutras, M. V. and Alexandrou, V. A. 1995. Runs, scans and URN model distributions: A unified Markov chain approach. Annals of the Institute of Statistical Mathematics, Vol. 47, Issue. 4, p. 743.

Malinowski, Jacek and Preuss, Wolfgang 1995. A recursive algorithm evaluating the exact reliability of a consecutive κ-within-m-out-of-n:F system. Microelectronics Reliability, Vol. 35, Issue. 12, p. 1461.

Koutras, M. V. 1996. On a Markov chain approach for the study of reliability structures. Journal of Applied Probability, Vol. 33, Issue. 2, p. 357.

Hwang, Frank K. and Wright, Paul E. 1997. An O(n log n) algorithm for the generalized birthday problem. Computational Statistics & Data Analysis, Vol. 23, Issue. 4, p. 443.

2001. Runs and Scans with Applications. p. 389.

Naus, Joseph 2006. Springer Handbook of Engineering Statistics. p. 775.

Triantafyllou, Ioannis S. and Koutras, Markos V. 2011. Signature and IFR Preservation of 2-Within-Consecutive $k$-out-of-$n$: $F$ Systems. IEEE Transactions on Reliability, Vol. 60, Issue. 1, p. 315.

Download full list

Article contents

Note on a clustering problem

Abstract

Keywords

Access options

References

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

Note on a clustering problem

Abstract

Keywords

Access options

References

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests