Abstract
The true self-avoiding random walk is defined as the statistical problem of a traveler who steps randomly, but tries to avoid places he has already visited. We show that this problem is different from the problem of a self-repelling chain (polymer problem). Most striking is perhaps the fact that the upper critical dimensionality of such a walk is 2. Renormalization-group theory is applied to compute logarithmic corrections to ordinary random-walk behavior in two dimensions. The theoretical predictions are confirmed by computer simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
