Related papers: Self Avoiding Walks in Four Dimensions: Logarithmi…

We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice $Z^d$. The method is based on loop erasure and restoration, and does not require exact…

We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…

A celebrated problem in numerical analysis is to consider Brownian motion originating at the centre of a $10 \times 1$ rectangle, and to evaluate the ratio of probabilities of a Brownian path hitting the short ends of the rectangle before…

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…

We give the correct analytic expression of a finite integral appearing in the four-loop computation of the renormalization-group functions for the two-dimensional nonlinear sigma-model on the square lattice with standard action, explaining…

We study the scaling properties of polymers in a d-dimensional medium with quenched defects that have power law correlations ~r^{-a} for large separations r. This type of disorder is known to be relevant for magnetic phase transitions. We…

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 introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these enumerations to study the properties of this…

While completely self-avoiding quantum walks have the distinct property of leading to a trivial unidirectional transport of a quantum state, an interesting and non-trivial dynamics can be constructed by restricting the self-avoidance to a…

This is a rather personal review of the problem of self-avoiding walks and polygons. After defining the problem, and outlining what is known rigorously and what is merely conjectured, I highlight the major outstanding problems. I then give…

We study large deviations for random walks on Lie groups defined by $\sigma_n^n = \exp(\frac1nX_1)\cdots\exp(\frac1nX_n)$, where $\{X_n\}_{n\geq1}$ is an i.i.d sequence of bounded random variables in the Lie algebra $\mathfrak{g}$. We…

We calculate the connective constant for self-avoiding walks on the simple cubic lattice to unprecedented accuracy, using a novel application of the pivot algorithm. We estimate that \mu = 4.684 039 931(27). Our method also provides…

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 =…

We obtain large deviations estimates for the self-intersection local times for a symmetric random walk in dimension 3. Also, we show that the main contribution to making the self-intersection large, in a time period of length $n$, comes…

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.…

We investigate neighbor-avoiding walks on the simple cubic lattice in the presence of an adsorbing surface. This class of lattice paths has been less studied using Monte Carlo simulations. Our investigation follows on from our previous…

We introduce planar random walk conditioned to avoid its past convex hull, and we show that it escapes at a positive limsup speed. Experimental results show that fluctuations from a limiting direction are on the order of n^(3/4). This…

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…

Counting the number of N-step self-avoiding walks (SAWs) on a lattice is one of the most difficult problems of enumerative combinatorics. Once we give up calculating the exact number of them, however, we have a chance to apply powerful…