Related papers: On the growth constant for square-lattice self-avo…

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 have analysed the recently extended series for the number of self-avoiding walks (SAWs) $C_L(1)$ that cross an $L \times L$ square between diagonally opposed corners. The number of such walks is known to grow as $\lambda_S^{L^2}.$ We…

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 derive the nested Bethe Ansatz solution of the fully packed O($n$) loop model on the honeycomb lattice. From this solution we derive the bulk free energy per site along with the central charge and geometric scaling dimensions describing…

We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…

We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…

We infer upper and lower bounds on the exponential growth constants $\alpha(\Lambda)$, $\alpha_0(\Lambda)$, and $\beta(\Lambda)$ describing the large-$n$ behavior of, respectively, the number of acyclic orientations, acyclic orientations…

Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a…

The partition function of the O(n) loop model on the honeycomb lattice is mapped to that of the O(n) loop model on the 3-12 lattice. Both models share the same operator content and thus critical exponents. The critical points are related…

We compute the exponent gamma for self-avoiding walks in three dimensions. We get gamma = 1.1575 +- 0.0006 in agreement with renormalization-group predictions. Earlier Monte Carlo and exact-enumeration determinations are now seen to be…

We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-dimensional self-avoiding walks, for the purpose of efficiently calculating an observable that corresponds to the probability that pairs of…

The growth exponent $\alpha$ for loop-erased or Laplacian random walk on the integer lattice is defined by saying that the expected time to reach the sphere of radius $n$ is of order $n^\alpha$. We prove that in two dimensions, the growth…

A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent…

We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…

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…

In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…

The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number $\sigma_{n}$ of self-avoiding walks of length $n$ in $G$ from a given vertex. We prove a formula for the connective constant for free products of…

We introduce an efficient nonreversible Markov chain Monte Carlo algorithm to generate self-avoiding walks with a variable endpoint. In two dimensions, the new algorithm slightly outperforms the two-move nonreversible Berretti-Sokal…

In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Green's function for the process equals 1/x^2. If the process is modified so as to be weakly self-repelling, it was shown that…

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…