Related papers: The impatient collector
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets $d$ distinct coupons each run and she chooses the one that she has the least so far. On the asymptotic case when the number…
We initiate the study of the Careless Coupon Collector's Problem (CCCP), a novel variation of the classical coupon collector, that we envision as a model for information systems such as web crawlers, dynamic caches, and fault-resilient…
The article explores the asymptotic behavior of the expected number of drawings in the Coupon Collector's Problem with group-drawing under the uniform distribution. In this variant, each draw consists of a package of $s$ distinct coupons…
We consider a generalisation of the classical coupon collector's problem, in which at each time step a collector either receives a new copy of a randomly chosen coupon, or loses all their previously collected copies of that coupon. We…
Motivated by applications in bioinformatics, we consider the word collector problem, i.e. the expected number of calls to a random weighted generator of words of length $n$ before the full collection is obtained. The originality of this…
A collector samples coupons with replacement from a pool containing $g$ \textit{uniform} groups of coupons, where "uniform group" means that all coupons in the group are equally likely to occur. For each $j = 1, \dots, g$ let $T_j$ be the…
The following variant of the collector's problem has attracted considerable attention relatively recently (see, e.g., N. Pintacuda 1980, D. Foata H. Guo-Niu and B. Lass 2001, D. Foata and D. Zeilberger 2003, I. Adler, S. Oren and S. Ross…
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…
A collector wishes to collect $m$ complete sets of $N$ distinct coupons. The draws from the population are considered to be independent and identical distributed with replacement, and the probability that a type-$j$ coupon is drawn is noted…
We consider an extended variant of the classical coupon collector's problem with infinite number of collections. An arriving coupon is placed in the $r^{th}$ collection, $r\ge0$, if $r$ is the smallest index such that the corresponding…
The "double Dixie cup problem" of D.J. Newman and L. Shepp (1960) is a well-known variant of the coupon collector's problem, where the object of study is the number $T_{m}(N)$ of coupons that a collector has to buy in order to complete $m$…
Motivated by a problem in the theory of randomized search heuristics, we give a very precise analysis for the coupon collector problem where the collector starts with a random set of coupons (chosen uniformly from all sets). We show that…
Consider the coupon collector problem where each box of a brand of cereal contains a coupon and there are n different types of coupons. Suppose that the probability of a box containing a coupon of a specific type is $1/n$ and that we keep…
This paper is about the Coupon collector's problem. There are some coupons, or baseball cards, or other plastic knick-knacks that are put into bags of chips or under soda bottles, etc. A collector starts collecting these trinkets and wants…
A representation for the Riemann zeta function valid for arbitrary complex $s=\sigma+it$ is $\zeta(s)=\sum_{n=0}^\infty A(n,s)$, where \[A(n,s)=\frac{2^{-n-1}}{1-2^{1-s}} \sum_{k=0}^n \left(\!\begin{array}{c}n\\k\end{array}\!\right)…
Let $A$ be an elliptic operator on a compact manifold with boundary $M$, and let $\wp : \partial\M \to Y$ be a covering map, where $Y$ is a closed manifold. Let $A_C$ be a realization of $A$ subject to a coupling condition $C$ that is…
Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial…
In this note, we introduce a distributed twist on the classic coupon collector problem: a set of $m$ collectors wish to each obtain a set of $n$ coupons; for this, they can each sample coupons uniformly at random, but can also meet in…
We study heat traces associated with positive unbounded operators with compact inverses. With the help of the inverse Mellin transform we derive necessary conditions for the existence of a short time asymptotic expansion. The conditions are…
A popular variant of the collector's problem is the following: Assume there are $N$ different types of coupons with equal occurring probabilities. There is one main collector who collects coupons. When she gets a "double," she gives it to…