arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1510.09045math.PR
收藏

对数Zipf版本的优惠券收集器的问题

The logarithmic Zipf version of the coupon collector's problem

Aristides V. Doumas, Vassilis G. Papanicolaou

摘要:

收集者希望收集$m$完全不同的$N$优惠券。从群体中抽取的样本被认为是独立的,并且具有相同的分布,并进行替换,抽取$j$型样本的概率记为$p_{j}$。设$T_{m}(N)$为解决此问题所需的试验次数。我们提出了渐近的期望(5项加上一个错误),二次上升的时刻(6项加上一个错误),和方差的$T_{m}(N)$(首项),以及其极限分布$N\rightarrow \infty$,当\begin{equation*} p_{j}=\frac{a_{j}}{\sum_{j=2}^{N+1} a_{j}}, \,\,\,\text{where}\,\,\, a_{j}=\left(\ln j\right)^{-p}, \,\,p>0. \end{equation*}这些“对数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 as $p_{j}$. Let $T_{m}(N)$ the number of trials needed for this problem. We present the asymptotics for the expectation (five terms plus an error), the second rising moment (six terms plus an error), and the variance of $T_{m}(N)$ (leading term), as well as its limit distribution as $N\rightarrow \infty$, when \begin{equation*} p_{j}=\frac{a_{j}}{\sum_{j=2}^{N+1} a_{j}}, \,\,\,\text{where}\,\,\, a_{j}=\left(\ln j\right)^{-p}, \,\,p>0. \end{equation*} These "log-Zipf" classes of coupon probabilities are not covered by the existing literature and the present paper comes to fill this gap. Therefore, we enlarge the classes for which the collector's problem is solved (moments, variance, distribution).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑