Related papers: Quantitative sub-ballisticity of self-avoiding wal…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, $(4.8^2)$, and $(3.12^2)$ lattices. The bound is found by Kesten's method of irreducible bridges. This involves…
We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective…
The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…
We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…
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…
For $d \geq 2$ and $n \in \mathbb{N}$ even, let $p_n = p_n(d)$ denote the number of length $n$ self-avoiding polygons in $\mathbb{Z}^d$ up to translation. The polygon cardinality grows exponentially, and the growth rate $\lim_{n \in…
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…
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,…
Recently Beaton, de Gier and Guttmann proved a conjecture of Batchelor and Yung that the critical fugacity of self-avoiding walks interacting with (alternate) sites on the surface of the honeycomb lattice is $1+\sqrt{2}$. A key identity…
We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-\alpha}$ with $\alpha>0$.…
We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…
We study the winding angles of random and self-avoiding walks on square and cubic lattices with number of steps $N$ ranging up to $10^7$. We show that the mean square winding angle $\langle\theta^2\rangle$ of random walks converges to the…
In 2010, Duminil-Copin and Smirnov proved a long-standing conjecture of Nienhuis, made in 1982, that the growth constant of self-avoiding walks on the hexagonal (a.k.a. honeycomb) lattice is $\mu=\sqrt{2+\sqrt{2}}.$ A key identity used in…
In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to $${\lambda^{\# \mbox{edges}} n^{\# \mbox{loops}},}$$ where $\lambda, n \in…
We study the high-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
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 enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…
We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the…