Off-Lattice Random Walks with Excluded Volume: A New Method of Generation, Proof of Ergodicity and Numerical Results

Abstract

We describe a new algorithm, the reflection method, to generate off-lattice random walks of specified, though arbitrarily large, thickness in ${\mathbb{R}}^3$ and prove that our method is ergodic on the space of thick walks. The data resulting from our implementation of this method is consistent with the scaling of the squared radius of gyration of random walks, with no thickness constraint. Based on this, we use the data to describe the complex relationship between the presence and nature of knotting and size, thickness and shape of the random walk. We extend the current understanding of excluded volume by expanding the range of analysis of how the squared radius of gyration scales with length and thickness. We also examine the profound effect of thickness on knotting in open chains. We will quantify how thickness effects the size of thick open chains, calculating the growth exponent for squared radius of gyration as a function of thickness. We will also show that for radius $r\le 0.4$, increasing thickness by 0.1 decreases the probability of knot formation by 50% or more.

References in corpus (9)

• Critical Exponents, Hyperscaling and Universal Amplitude Ratios for Two- and Three-Dimensional Self-Avoiding Walks
• Polymers with spatial or topological constraints: theoretical and computational results
• Critical exponents for random knots
• Probing the entanglement and locating knots in ring polymers: a comparative study of different arc closure schemes
• Scaling exponents and probability distributions of DNA end-to-end distance
• Metastable tight knots in a worm-like polymer
• Average size of random polygons with fixed knot topology
• Characteristics of shape and knotting in ideal rings
• Average Structures of a Single Knotted Ring Polymer