On the minimum of independent collecting processes via the Stirling numbers of the second kind

preprint2022arXivOpen access

Abstract

We consider the combinatorial problem where pp players aim to a complete set of NN different types of items (species) which are uniformly distributed. Let the random variables TN(i),  i=1,2,⋯ ,pT_{N(i)},\,\,i=1,2,\cdots,p denoting the number of trials needed until all NN types are detected (at least once), respectively for each player. This paper studies the impact of the number pp in the asymptotics of the expectation, the second moment, and the variance of the random variable \begin{equation*} M_{N(p)}: = \bigwedge_{i=1}^p T_{N(i)},\,\,\,\,\,\,N\rightarrow \infty. \end{equation*} The main ingredient in the expression of these quantittes are sums involving the Stirling numbers of the second kind; for which the asymptotics are explored. At the end of the paper we conjecture on a remarkable \textit{combinatorial identity}, regarding alternating binomial sums. These sums have been studied (mainly) by P. Flajolet due to their applications to digital search trees and quadtrees.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.