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

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

2007-08-08

arxiv.org/abs/0708.1116v3

Computer Science

Computational Engineering, Finance, and Science

Title changed

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A variant of the Recoil Growth algorithm to generate multi-polymer systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A variant of the Recoil Growth algorithm to generate multi-polymer systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A variant of the Recoil Growth algorithm to generate multi-polymer systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-215745