A factorial moment distance and an application to the matching problem
classification
🧮 math.PR
keywords
distancematchingfactorialmomentproblemapplicationclassicalcompare
read the original abstract
In this note we introduce the notion of factorial moment distance for non-negative integer-valued random variables and we compare it with the total variation distance. Furthermore, we study the rate of convergence in the classical matching problem and in a generalized matching distribution.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.