The weighted words collector - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

The weighted words collector


We consider the word collector problem, i.e. the expected number of calls to a random weighted generator before all the words of a given length in a language are generated. The originality of this instance of the non-uniform coupon collector lies in the, potentially large, multiplicity of the words/coupons of a given probability/composition. We obtain a general theorem that gives an asymptotic equivalent for the expected waiting time of a general version of the Coupon Collector. This theorem is especially well-suited for classes of coupons featuring high multiplicities. Its application to a given language essentially necessitates knowledge on the number of words of a given composition/probability. We illustrate the application of our theorem, in a step-by-step fashion, on four exemplary languages, whose analyses reveal a large diversity of asymptotic waiting times, generally expressible as $\kappa \cdot m^p \cdot (\log{m})^q \cdot (\log \log{m})^r$, for $m$ the number of words, and $p, q, r$ some positive real numbers.
Fichier principal
Vignette du fichier
WordCollector-Daniele-Jeremie-Yann-2012.pdf (360.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00666399 , version 1 (04-02-2012)
hal-00666399 , version 2 (16-04-2012)



Jérémie Du Boisberranger, Danièle Gardy, Yann Ponty. The weighted words collector. AOFA - 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms - 2012, Nicolas, Broutin (INRIA, France) and Luc, Devroye (McGill, Canada), Jun 2012, Montreal, Canada. pp.243--264, ⟨10.46298/dmtcs.2998⟩. ⟨hal-00666399v2⟩
289 View
1846 Download



Gmail Facebook Twitter LinkedIn More