Abstract
AbstractThis paper examines the classical matching distribution arising in the “problem of coincidences”. We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed probability, and remaining non-matched items are allocated using simple random sampling without replacement. Our generalised matching distribution is a convolution of the classical matching distribution and the binomial distribution. We examine the properties of this latter distribution and show how its probability functions can be computed. We also show how to use the distribution for matching tests and inferences of matching ability.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Statistics and Probability
Reference18 articles.
1. Abramson LR (1973) Moments of a card matching distribution. Am Stat 27(4):166
2. Anderson TW (1943) On card matching. Ann Math Stat 14(4):426–435
3. Core Team R (2021) R: A language and environment for statistical computing. R Foundation for Statistical Computing: Vienna. https://www.R-project.org/
4. Crain BR (1992) On the matching problem in probability. Phi Mu Epsilon Journal 9(7):448–450
5. DasGupta A (2005) The matching, birthday and strong birthday problem: a contemporary review. J Stat Plan Inference 130:377–389