Related papers: Lectures on Self-Avoiding Walks
We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…
A comprehensive numerical study of self-avoiding walks (SAW's) on randomly diluted lattices in two and three dimensions is carried out. The critical exponents $\nu$ and $\chi$ are calculated for various different occupation probabilities,…
This paper extends the inductive approach to the lace expansion of van der Hofstad and Slade in order to prove Gaussian asymptotic behaviour for models with critical dimension other than 4. The results are applied by Holmes to study…
The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying…
We consider long-range self-avoiding walk, percolation and the Ising model on $\mathbb{Z}^d$ that are defined by power-law decaying pair potentials of the form $D(x)\asymp|x|^{-d-\alpha}$ with $\alpha>0$. The upper-critical dimension…
In order to study long chain polymers many lattice models accommodate a pulling force applied to a particular part of the chain, often a free endpoint. This is in addition to well-studied features such as energetic interaction between the…
We first study a model, introduced recently in \cite{ES}, of a critical branching random walk in an IID random environment on the $d$-dimensional integer lattice. The walker performs critical (0-2) branching at a lattice point if and only…
The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…
The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails,…
We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…
We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
We outline a proof, by a rigorous renormalisation group method, that the critical two-point function for continuous-time weakly self-avoiding walk on Z^d decays as |x|^{-(d-2)} in the critical dimension d=4, and also for all d>4.
The surface critical behaviour of the interacting self-avoiding trail is examined using transfer matrix methods coupled with finite-size scaling. Particular attention is paid to the critical exponents at the ordinary and special points…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
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 review some recent results obtained in the framework of the 2-dimensional Interacting Self-Avoiding Walk (ISAW). After a brief presentation of the rigorous results that have been obtained so far for ISAW we focus on the Interacting…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases 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…