Related papers: Self-Attracting Walk on Lattices
We present a Monte Carlo method that allows efficient and unbiased sampling of Hamiltonian walks on a cubic lattice. Such walks are self-avoiding and visit each lattice site exactly once. They are often used as simple models of globular…
We study three different random walk models on several two-dimensional lattices by Monte Carlo simulations. One is the usual nearest neighbor random walk. Another is the nearest neighbor random walk which is not allowed to backtrack. The…
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…
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…
We consider self-avoiding walks terminally attached to a surface at which they can adsorb. A force is applied, normal to the surface, to desorb the walk and we investigate how the behaviour depends on the vertex of the walk at which the…
The solvability of the three-dimensional O($N$) scalar field theory in the large $N$ limit makes it an ideal toy model exhibiting "walking" behavior, expected in some SU($N$) gauge theories with a large number of fermion flavors. We study…
We consider the model of self-avoiding walks on the $d$-dimensional hypercubic lattice interacting with a $d^*$-dimensional defect, where $1\leq d^*<d$. Such an interaction can be attractive or repulsive, and is controlled by a Boltzmann…
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,…
Lattice model of directed self avoiding walk is used to investigate adsorption properties of a semiflexible sequential copolymer chain on an impenetrable curved surface on a hexagonal lattice in two dimensions. Walks of the copolymer chains…
We study via Monte Carlo simulation a generalisation of the so-called vertex interacting self-avoiding walk (VISAW) model on the square lattice. The configurations are actually not self-avoiding walks but rather restricted self-avoiding…
Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…
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…
We consider a random walk on the Manhattan lattice. The walker must follow the orientations of the bonds in this lattice, and the walker is not allowed to visit a site more than once. When both possible steps are allowed, the walker chooses…
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 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…
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…
In this paper, we investigate the quest for a single target, that remains fixed in a lattice, by a set of independent walkers. The target exhibits a fluctuating behavior between trap and ordinary site of the lattice, whereas the walkers…
A random walk starts from the origin of a d-dimensional lattice. The occupation number n(x,t) equals unity if after t steps site x has been visited by the walk, and zero otherwise. We study translationally invariant sums M(t) of observables…
We consider various two-dimensional lattices such as square, Kagome, Lieb, honeycomb, dice lattices of finite extent, to study the effect of lattice profile in terms of the number of nearest neighbour and connectivity patterns on the…
We consider a self-avoiding walk on the $d$-dimensional hypercubic lattice, terminally attached to an impenetrable hyperplane at which it can adsorb. When a force is applied the walk can be pulled off the surface and we consider the…