Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-28T14:45:55.931Z Has data issue: false hasContentIssue false

Some asymptotic results on multiple matching

Published online by Cambridge University Press:  14 July 2016

R. Hafner
Affiliation:
Universität Dortmund
W. Sendler
Affiliation:
Universität Dortmund

Abstract

We consider sn randomly chosen permutations of the numbers 1, 2, …, n, and write them under each other, thus forming an s × n matrix, called “random-batch”. A rule, prescribing how many elements of a column may occur exactly one time, how many may occur exactly two times, etc., is called a fixpoint-structure. Assuming each possible permutation to be chosen with equal probability, the number of columns having a certain fixpoint-structure F is a random variable X(F). The limiting distribution of X(F) for n→ ∞ is considered for different cases of s = s(n). The main result (Theorem 4) says, that the common distribution of a finite number t of given fixpoint-structures tends to the product of t Poisson-laws, n→ ∞.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1974 

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

[1] Riordan, J. (1958) An Introduction to Combinatorial Analysis. John Wiley, New York.Google Scholar
[2] Wilks, S. (1962) Mathematical Statistics. John Wiley, New York.Google Scholar
[3] Erdös, P. and Kaplansky, I. (1946) The asymptotic number of Latin rectangles. Amer. J. Math. 68, 230236.Google Scholar
[4] Yamamoto, K. (1951) On the asymptotic number of Latin rectangles. Japan. J. Math. 21, 113119.Google Scholar
[5] Loève, M. (1963) Probability Theory. 3rd. ed. John Wiley, New York.Google Scholar