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

Abstract : The Recoil Growth algorithm, proposed in 1999 by Consta 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 [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00166687
Contributor : Florian Simatos <>
Submitted on : Saturday, July 11, 2009 - 3:15:46 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Wednesday, September 22, 2010 - 12:54:22 PM

File

a_variant_of_the_recoil_growth...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00166687, version 2

Collections

Citation

Florian Simatos. A variant of the Recoil Growth algorithm to generate multi-polymer systems. 2009. ⟨hal-00166687v2⟩

Share

Metrics

Record views

248

Files downloads

97