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

Abstract : 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.
Keywords :
Type de document :
Communication dans un congrès
Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.283-294, 2008, DMTCS Proceedings
Domaine :

Littérature citée [7 références]

https://hal.inria.fr/hal-01194686
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 7 septembre 2015 - 12:51:09
Dernière modification le : mercredi 10 mai 2017 - 17:41:11
Document(s) archivé(s) le : mardi 8 décembre 2015 - 13:02:36

### Fichier

dmAI0118.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01194686, version 1

### Citation

Florian Simatos. A variant of the Recoil Growth algorithm to generate multi-polymer systems. Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.283-294, 2008, DMTCS Proceedings. 〈hal-01194686〉

### Métriques

Consultations de la notice

## 177

Téléchargements de fichiers