Related papers: New Lower Bounds on the Self-Avoiding-Walk Connect…

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…

By modifying the automaton used by P{\"o}nitz and Tittman [4], and considering loops of length up to 26, we obtain 2.662343 as an upper bound for the connective constant in the lattice Z 2 .

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…

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…

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…

Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…

We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…

We consider a self-avoiding walk on the dual $\mathbb{Z}^2$ lattice. This walk can traverse the same square twice but cannot cross the same edge more than once. The weight of each square visited by the walk depends on the way the walk…

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…

Let $c_n = c_n(d)$ denote the number of self-avoiding walks of length $n$ starting at the origin in the Euclidean nearest-neighbour lattice $\mathbb{Z}^d$. Let $\mu = \lim_n c_n^{1/n}$ denote the connective constant of $\mathbb{Z}^d$. In…

We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…

Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…

Let Z_N be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Z^d with parameter p>p_c(Z^d). The object of this paper is to study the connective…

Following similar analysis to that in Lacoin (PTRF 159, 777-808, 2014), we can show that the quenched critical point for self-avoiding walk on random conductors on the d-dimensional integer lattice is almost surely a constant, which does…

We introduce classes of restricted walks, surfaces and their generalisations. For example, self-osculating walks (SOWs) are supersets of self-avoiding walks (SAWs) where edges are still not allowed to cross but may 'kiss' at a vertex. They…

We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…

We prove that self-avoiding walk on Z^d is sub-ballistic in any dimension d at least two. That is, writing ||u|| for the Euclidean norm of u \in Z^d, and SAW_n for the uniform measure on self-avoiding walks gamma:{0,...,n} \to Z^d for which…

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 use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…

The Hammersley-Welsh bound (1962) states that the number $c_n$ of length $n$ self-avoiding walks on $\mathbb{Z}^d$ satisfies \[ c_n \leq \exp \left[ O(n^{1/2}) \right] \mu_c^n, \] where $\mu_c=\mu_c(d)$ is the connective constant of…