Papers
Topics
Authors
Recent
Search
2000 character limit reached

Uniform versus Zipf distribution in a mixing collection process

Published 22 Apr 2019 in math.PR | (1904.09817v1)

Abstract: We consider the following variant of the classic collector's problem: The family of coupon probabilities is the mixing of two subfamilies one of which is the \textit{uniform} family, while the other belongs to the well known \textit{Zipf family}. We obtain asymptotics for the expectation, the second rising moment, and the variance of the random variable $T_N$, namely the number of trials needed for all the $N$ types of coupons to be collected (at least once, with replacement) as $N \rightarrow \infty$. It is interesting that the effect of the uniform subcollection on the asymptotics of the expectation of $T_N$ (at least up to the sixth term) appears only in the leading factor of the expectation of $T_N$. The limiting distribution of $T_N$ is derived as well. These results answer a question placed in a recent work of ours [\textit{Electron. J. Probab.} \textbf{18} (2012) 1--15].

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.