arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2607.01463math.PR
收藏

两种不同保留规则的多重优惠券收集者模型

Two Multi--Draw Coupon Collector models with different retention rules

National Technical University of Athens(雅典国立技术大学);Archimedes/Athena Research Center(阿基米德/雅典研究中心);Canisius University(卡尼修斯大学)

Aristides V. Doumas, S. Spektor

AI总结:

研究两种多重优惠券收集者变体,分别保留所有新优惠券或选择最少收集的优惠券,推导完整收集N种均匀分布优惠券所需试验次数的期望、渐近展开、方差渐近及极限分布,并应用于DNA数据存储。

摘要:

本文研究了广义优惠券收集者问题的两种变体:在每次运行中,收集者收到d张不同的优惠券,并保留所有新观察到的优惠券(问题I),或者选择每次运行中收集最少的优惠券(问题II)。在两种情况下,我们推导了表示收集完整N种不同类型优惠券(均匀分布)所需试验次数的随机变量的期望的显式公式。在两种情况下,我们给出了包含相应误差项的前四项渐近展开。然后,对于两个问题,我们推导了当N→∞时的完整渐近展开。我们进一步获得了方差的领头阶行为,表明在两个问题中Var∼π²/6·N²/d²,并建立了收敛到极限定律的速率。我们的分析基于应用于交替二项式和的Nørlund-Rice积分方法以及渐近分析的经典工具。问题II的领头渐近项由W. Xu和A. K. Tang [J. Appl. Probab. 48 (2011), 1081–1094]获得。最后,对于两个问题,我们推导了在适当归一化下的极限分布。如预期,极限是标准Gumbel分布;然而,问题I和II的归一化不同。作为一个应用,我们表明问题I精确描述了基于组合基序的DNA数据存储中的测序覆盖过程,并且我们的展开为该设置提供了闭式覆盖估计。

英文摘要:

In this paper we study two variants of the generalized coupon collector's problem, where our collector receives at each run d distinct coupons and keeps all the new observed coupons (Problem I), while he chooses the least--collected coupon at each run (Problem II). In both cases we derive explicit formulae for the average of the random variable denoting the number of trials for a complete set of N different types of coupons, which are uniformly distributed. In both cases we present the asymptotic expansion up to the fourth term including the corresponding error term. Then, for both problems we derive the full asymptotic expansion as N\rightarrow \infty. We further obtain the leading-order behaviour of the variance, showing that in both problems \mathrm{Var}\sim \frac{π^2}{6}\frac{N^2}{d^2}, and we establish a rate of convergence to the limiting law. Our analysis is based on the Nørlund--Rice integral method applied to an alternating binomial sum and classical tools from asymptotic analysis. The leading asymptotic term for Problem II was obtained by W. Xu and A. K. Tang [\textit{J. Appl. Probab.} \textbf{48} (2011), 1081--1094]. Finally, for both problems, we derive the limiting distribution under the appropriate normalization. As expected, the limit is standard Gumbel; however, the normalization differs between Problems I and II. As an application, we show that Problem~I describes exactly the sequencing-coverage process in combinatorial motif-based DNA data storage, and our expansions yield closed-form coverage estimates for that setting.

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

↑