Related papers: Two-dimensional self-avoiding walks and polymer ad…
The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…
We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…
Prudent walks are self-avoiding walks which cannot step towards an already occupied vertex. We introduce a new model of adsorbing prudent walks on the square lattice, which start on an impenetrable surface and accrue a fugacity $a$ with…
Exact results are obtained for random walks on finite lattice tubes with a single source and absorbing lattice sites at the ends. Explicit formulae are derived for the absorption probabilities at the ends and for the expectations that a…
Motivated by recent claims of a proof that the length scale exponent for the end-to-end distance scaling of self-avoiding walks is precisely $7/12=0.5833...$, we present results of large-scale simulations of self-avoiding walks and…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks,…
A linear polymer grafted to a hard wall and underneath an AFM tip can be modelled in a lattice as a grafted lattice polymer (or self-avoiding walk) compressed underneath a piston approaching the wall. As the piston approaches the wall the…
We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $\nu$ for…
We study the motion of a particle on the two-dimensional honeycomb lattice, whose sites are occupied by either flipping rotators or flipping mirrors, which scatter the particle according to a deterministic rule. For both types of scatterers…
These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central problems, an account is given of the…
We consider lattice self-avoiding walks and discuss the dynamic critical behavior of two dynamics that use local and bilocal moves and generalize the usual reptation dynamics. We determine the integrated and exponential autocorrelation…
We study self-avoiding walks on restricted square lattices, more precisely on the lattice strips $\mathbb{Z} \times \{-1,0,1\}$ and $\mathbb{Z}\times \{-1,0,1,2\}$. We obtain the value of the connective constant for the $\mathbb{Z} \times…
This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary…
The $n$-vector spin model, which includes the self-avoiding walk (SAW) as a special case for the $n \rightarrow 0 $ limit, has an upper critical dimensionality at four spatial dimensions (4D). We simulate the SAW on 4D hypercubic lattices…
We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…
We consider self-avoiding walks terminally attached to a surface at which they can adsorb. A force is applied, normal to the surface, to desorb the walk and we investigate how the behaviour depends on the vertex of the walk at which the…
Self-avoiding walks are a simple and well-known model of long, flexible polymers in a good solvent. Polymers being pulled away from a surface by an external agent can be modelled with self-avoiding walks in a half-space, with a Boltzmann…
We prove several rigorous results about the asymptotic behaviour of the numbers of polygons and self-avoiding walks confined to a square on the square lattice. Specifically we prove that the dominant asymptotic behaviour of polygons…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…