A variant of the Recoil Growth algorithm to generate multi-polymer systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2008

A variant of the Recoil Growth algorithm to generate multi-polymer systems

Florian Simatos
  • Fonction : Auteur
  • PersonId : 841874

Résumé

The Recoil Growth algorithm, proposed in 1999 by Consta $\textit{et al.}$, is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. Such problems are closely related to the generation of self-avoiding paths. In this paper, we study a variant of the original Recoil Growth algorithm, where we constrain the generation of a new polymer to take place on a specific class of graphs. This makes it possible to make a fine trade-off between computational cost and success rate. We moreover give a simple proof for a lower bound on the irreducibility of this new algorithm, which applies to the original algorithm as well.
Fichier principal
Vignette du fichier
dmAI0118.pdf (224.26 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01194686 , version 1 (07-09-2015)

Identifiants

Citer

Florian Simatos. A variant of the Recoil Growth algorithm to generate multi-polymer systems. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.283-294, ⟨10.46298/dmtcs.3571⟩. ⟨hal-01194686⟩
110 Consultations
699 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More