A generalised matching distribution for the problem of coincidences

DOI10.1007/S11009-023-10067-6arXiv2112.12442OpenAlexW4389743797MaRDI QIDQ6204670FDOQ6204670

Authors: Ben O'Neill 

Publication date: 2 April 2024

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Abstract: This 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 computes. We also show how to use the distribution for matching tests and inferences of matching ability.

Full work available at URL: https://arxiv.org/abs/2112.12442

zbMATH Keywords

problem of coincidenceshat-check problemmatching testclassical matching distributiongeneralised matching distributionmatching statisticsecret-Santa problem

Mathematics Subject Classification ID

Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cites Work

• Title not available (Why is that?)
• On stirling numbers of the second kind
• Title not available (Why is that?)
• The problem of coincidences
• On the Asymptotic Solution of a Card-Matching Problem
• On Card Matching
• The matching, birthday and the strong birthday problem: a contemporary review
• Stirling numbers of the second kind
• Smallest covering regions and highest density regions for discrete distributions
• Derangements, Permanents, and Christmas Presents

This page was built for publication: A generalised matching distribution for the problem of coincidences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204670)