Related papers: Exactly-Solvable Self-Trapping Lattice Walks. Part…
The Interacting Growth Walk (IGW) is a kinetic algorithm proposed recently for generating long, compact, self avoiding walks. The growth process in IGW is tuned by the so called growth temperature $T' = 1/(k_B \beta ')$. On a square lattice…
We investigate semi-stiff interacting self-avoiding walks on the square lattice with random impurities. The walks are simulated using the flatPERM algorithm and the inhomogeneity is realised as a random fraction of the lattice that is…
We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…
We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…
This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary…
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…
A self-avoiding walk (SAW) is a path on a graph that visits each vertex at most once. The mean square displacement of an $n$-step SAW is the expected value of the square of the distance between the ending point and the starting point of an…
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…
We study random walks evolving in continuous time on a one-dimensional lattice where each site $x$ hosts a quenched random potential $U_x$. The potentials on different sites are independent, identically distributed Gaussian random…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
We consider a model of semi-flexible interacting self-avoiding trails (sISAT's) on a lattice, where the walks are constrained to visit each lattice edge at most once. Such models have been studied as an alternative to the self-attracting…
The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures…
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 show that the Density of States (DoS) for lattice Self Avoiding Walks can be estimated by using an inverse algorithm, called flatIGW, whose step-growth rules are dynamically adjusted by requiring the energy histogram to be locally flat.…
A comprehensive numerical study of self-avoiding walks (SAW's) on randomly diluted lattices in two and three dimensions is carried out. The critical exponents $\nu$ and $\chi$ are calculated for various different occupation probabilities,…
We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite…
We present a real space renormalization-group map for probabilities of random walks on a hierarchical lattice. From this, we study the asymptotic behavior of the end-to-end distance of a weakly self- avoiding random walk (SARW) that…
We have analyzed geometric and topological features of self-avoiding walks. We introduce a new kind of walk: the loop-deleted self-avoiding walk (LDSAW) motivated by the interaction of chromatin with the nuclear lamina. Its critical…
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.…