A variant of the Recoil Growth algorithm to generate multi-polymer systems
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 or...
Main Author: | Florian Simatos |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3571/pdf |
Similar Items
-
Random Records and Cuttings in Split Trees: Extended Abstract
by: Cecilia Holmgren
Published: (2008-01-01) -
A note on the fragmentation of a stable tree
by: Philippe Marchal
Published: (2008-01-01) -
On square permutations
by: Enrica Duchi, et al.
Published: (2008-01-01) -
On density of truth of the intuitionistic logic in one variable
by: Zofia Kostrzycka
Published: (2008-01-01) -
Analytic Combinatorics of the Mabinogion Urn
by: Philippe Flajolet, et al.
Published: (2008-01-01)