A factorial moment distance and an application to the matching problem

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.

arXiv comment10 pages