Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models

Résumé

The present work analyzes the redundancy of sets of combinatorial objects produced by a weighted random generation algorithm proposed by Denise et al. This scheme associates weights to the terminals symbols of a weighted context-free grammar, extends this weight definition multiplicatively on words, and draws words of length $n$ with probability proportional their weight. We investigate the level of redundancy within a sample of $k$ word, the proportion of the total probability covered by $k$ words (coverage), the time (number of generations) of the first collision, and the time of the full collection. For these four questions, we use an analytic urn analogy to derive asymptotic estimates and/or polynomially computable exact forms. We illustrate these tools by an analysis of an RNA secondary structure statistical sampling algorithm introduced by Ding et al.
Fichier principal
Vignette du fichier
GASCOM-2010-Allocations.pdf (379.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00543150 , version 1 (06-12-2010)

Identifiants

  • HAL Id : inria-00543150 , version 1
  • ARXIV : 1012.1129

Citer

Danièle Gardy, Yann Ponty. Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models. GASCOM - 8th conference on random generation of combinatorial structures - 2010, LACIM, UQAM, Sep 2010, Montréal, Canada. 14pp. ⟨inria-00543150⟩
206 Consultations
90 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More