Convergence in distribution for subset counts between random sets
Summary: Erdős posed the problem of how many random subsets need to be chosen from a set of \(n\) elements, each element appearing in each subset with probability \(p=1/2\), in order that at least one subset is contained in another. Rényi answered this question, but could not determine the limiting probability distribution for the number of subset counts because the higher moments diverge to infinity. The model considered by Rényi with \(p\) arbitrary is denoted by \({\mathcal P}(m,n,p)\), where \(m\) is the number of random subsets chosen. We give a necessary and sufficient condition on \(p(n)\) and \(m(n)\) for subset counts to be asymptotically Poisson and find rates of convergence using Stein's method. We discuss how Poisson limits can be shown for other statistics of \({\mathcal P} (m,n,p)\).
- Random set partitions: Asymptotics of subset counts
- The almost sure number of pairwise sums for certain random integer subsets considered by P. Erdős
- Total variation distance for Poisson subset numbers
- scientific article; zbMATH DE number 3947404
- Some applications of the Stein-Chen method for proving Poisson convergence
This page was built for publication: Convergence in distribution for subset counts between random sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883678)
