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.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01194686
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, September 7, 2015 - 12:51:09 PM
Last modification on : Tuesday, May 14, 2019 - 1:16:37 AM
Long-term archiving on : Tuesday, December 8, 2015 - 1:02:36 PM

File

dmAI0118.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01194686, version 1

Collections

Citation

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. ⟨hal-01194686⟩

Share

Metrics

Record views

233

Files downloads

379