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: | |
|---|---|
| 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 |
| _version_ | 1797270411161894912 |
|---|---|
| author | Florian Simatos |
| author_facet | Florian Simatos |
| author_sort | Florian Simatos |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T02:03:50Z |
| format | Article |
| id | doaj.art-45a18e470cc14faa94ff750bb279d20d |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:03:50Z |
| publishDate | 2008-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-45a18e470cc14faa94ff750bb279d20d2024-03-07T14:36:56ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502008-01-01DMTCS Proceedings vol. AI,...Proceedings10.46298/dmtcs.35713571A variant of the Recoil Growth algorithm to generate multi-polymer systemsFlorian Simatos0Networks, Algorithms and ProbabilitiesThe 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.https://dmtcs.episciences.org/3571/pdfmetropolismulti-polymer systems[info.info-dm] computer science [cs]/discrete mathematics [cs.dm][math.math-ds] mathematics [math]/dynamical systems [math.ds][math.math-co] mathematics [math]/combinatorics [math.co] |
| spellingShingle | Florian Simatos A variant of the Recoil Growth algorithm to generate multi-polymer systems Discrete Mathematics & Theoretical Computer Science metropolis multi-polymer systems [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-ds] mathematics [math]/dynamical systems [math.ds] [math.math-co] mathematics [math]/combinatorics [math.co] |
| title | A variant of the Recoil Growth algorithm to generate multi-polymer systems |
| title_full | A variant of the Recoil Growth algorithm to generate multi-polymer systems |
| title_fullStr | A variant of the Recoil Growth algorithm to generate multi-polymer systems |
| title_full_unstemmed | A variant of the Recoil Growth algorithm to generate multi-polymer systems |
| title_short | A variant of the Recoil Growth algorithm to generate multi-polymer systems |
| title_sort | variant of the recoil growth algorithm to generate multi polymer systems |
| topic | metropolis multi-polymer systems [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-ds] mathematics [math]/dynamical systems [math.ds] [math.math-co] mathematics [math]/combinatorics [math.co] |
| url | https://dmtcs.episciences.org/3571/pdf |
| work_keys_str_mv | AT floriansimatos avariantoftherecoilgrowthalgorithmtogeneratemultipolymersystems AT floriansimatos variantoftherecoilgrowthalgorithmtogeneratemultipolymersystems |