Simulating self-avoiding walks in bounded domains

Details Simulating self-avoiding walks in bounded domains Simulating self-avoiding walks in bounded domains

2011-10-19

arxiv.org/abs/1110.4167v1

Mathematics

Probability

17 pages, 4 figures

Scientific paper

Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to have the same scaling limit. The advantage of our ensemble is that it can be simulated using the pivot algorithm. Our ensemble makes it possible to accurately study SLE predictions for the SAW in bounded simply connected domains. One such prediction is the distribution along the boundary of the endpoint of the SAW. We use the pivot algorithm to simulate our ensemble and study this density. In particular the lattice effects in this density that persist in the scaling limit are seen to be given by a purely local function.

Affiliated with

Also associated with

No associations

Rating

Simulating self-avoiding walks in bounded domains 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 Simulating self-avoiding walks in bounded domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulating self-avoiding walks in bounded domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-596727