A self-avoiding walk is a path on a lattice that does not visit the same site more than once. In spite of this simple definition, many of the most basic questions about this model are difficult …
We reconsider the conceptual foundations of the renormalization-group (RG) formalism, and prove some rigorous theorems on the regularity properties and possible pathologies of the …
B Li, N Madras, AD Sokal - Journal of Statistical Physics, 1995 - Springer
We make a high-precision Monte Carlo study of two-and three-dimensional self-avoiding walks (SAWs) of length up to 80,000 steps, using the pivot algorithm and the Karp-Luby …
This book focuses on percolation on high-dimensional lattices. We give a general introduction to percolation, stating the main results and defining the central objects. We …
T Hara, G Slade - Communications in Mathematical Physics, 1992 - Springer
We use the lace expansion to study the standard self-avoiding walk in the d-dimensional hypercubic lattice, for d≧ 5. We prove that the number cn of n-step self-avoiding walks …
EJJ Van Rensburg - Journal of Physics A: Mathematical and …, 2009 - iopscience.iop.org
The numerical simulation of self-avoiding walks remains a significant component in the study of random objects in lattices. In this review, I give a comprehensive overview of the …
We prove that nearest-neighbor percolation in dimensions d≧11 displays mean-field behavior by proving that the infrared bound holds, in turn implying the finiteness of the …
Polymer chains that interact with themselves and/or with their environment are fascinating objects, displaying a range of interesting physical and chemical phenomena. The focus in …
The self-avoiding walk is a classical model in statistical mechanics, probability theory and mathematical physics. It is also a simple model of polymer entropy which is useful in …