Related papers: New upper bound for the connective constant for sq…
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical percolation cluster on $\bbZ^d$. More precisely, we count $Z_N$ the number of self-avoiding paths of length $N$ on the infinite cluster,…
Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect,…
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 find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the…
We compute the QCD running coupling on the lattice as defined from the 3-gluon vertex. We present the results of an exploratory study at $\beta=6.0$ on a $16^4$ lattice, which show that for momenta larger than 2 \Gev, the coupling runs…
This is an exposition of the theorem from the title, which says that the number of self-avoiding walks with n steps in the hexagonal lattice has asymptotics (2cos(pi/8))^{n+o(n)}. We lift the key identity to formal level and simplify the…
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…
For the hard-core lattice gas model defined on independent sets weighted by an activity $\lambda$, we study the critical activity $\lambda_c(\mathbb{Z}^2)$ for the uniqueness/non-uniqueness threshold on the 2-dimensional integer lattice…
We investigate, by series methods, the behaviour of interacting self-avoiding walks (ISAWs) on the honeycomb lattice and on the square lattice. This is the first such investigation of ISAWs on the honeycomb lattice. We have generated data…
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…
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 describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71.…
Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, assigning to every vertex an integer, called height. Bridges…
We prove quantitative sub-ballisticity for the self-avoiding walk on the hexagonal lattice. Namely, we show that with high probability a self-avoiding walk of length $n$ does not exit a ball of radius $O(n/\log{n})$. Previously, only a…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
Self-avoiding walks on the body-centered-cubic (BCC) and face-centered-cubic (FCC) lattices are enumerated up to lengths 28 and 24, respectively, using the length-doubling method. Analysis of the enumeration results yields values for 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 present a high-statistics Monte Carlo determination of the exponent gamma for self-avoiding walks on a Manhattan lattice in two dimensions. A conservative estimate is $\gamma \gtapprox 1.3425(3)$, in agreement with the universal value…