Related papers: Coupon collector's probabilities and generating fu…
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…
The paper introduces a modified version of the classical Coupon Collector's Problem entailing exchanges and cooperation between multiple players. Results of the development show that, within a proper Markov framework, the complexity of the…
Computer-based tests with randomly generated questions allow a large number of different tests to be generated. Given a fixed number of alternatives for each question, the number of tests that need to be generated before all possible…
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…
Testing probabilistic programs is non-trivial due to their stochastic nature. Given an input, the program may produce different outcomes depending on the underlying stochastic choices in the program. This means testing the expected outcomes…
We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their…
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…
We prove that, in the coupon collector's problem, the point processes given by the times of $r$-th arrivals for coupons of each type, centered and normalized in a proper way, converge toward a non-homogeneous Poisson point process. This…
Empirical studies of scientific discovery---so-called Eurekometrics---have indicated that the output of exploration proceeds as a logistic growth curve. Although logistic functions are prevalent in explaining population growth that is…
We study a labeled variant of the classical Coupon Collector Problem (CCP), recently introduced by Tan et al., where coupons arrive in groups and only the set of labels is revealed. The goal is to determine the expected number of group…
The solution of the classical Coupon Collector's Problem is based on the assumptions that all stickers are independently and uniformly distributed. We can prove statistically as well as analytically that in particular the assumption of…
In this note we evaluate the expectation and variance of the waiting time to complete $m$ parallel collections of coupons, in the case of coupons which arrives independently, one by one and with equal probabilities.
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
This paper is concerned with numerical algorithms for gain function approximation in the feedback particle filter. The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian. The problem is to…
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 examine the negative occupancy distribution and the coupon-collector distribution, both of which arise as distributions relating to hitting times in the extended occupancy problem. These distributions constitute a full solution to a…
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…
We propose an approach to analyze the asymptotic behavior of P\'olya urns based on the contraction method. For this, a new combinatorial discrete time embedding of the evolution of the urn into random rooted trees is developed. A…
This paper introduces and analyzes a particular class of Polya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color…
We consider a generalisation of the classical coupon collector problem. We define a super-coupon to be any $s$-subset of a universe of $n$ coupons. In each round, a random $r$-subset from the universe is drawn and all its $s$-subsets are…