Related papers: Self-avoiding walks and polygons -- an overview
If the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half-space and in a sphere. The ensembles of SAW's used to define these hitting densities involve walks…
We investigate polymers pulled away from an interacting surface, where the force is applied to the untethered endpoint and at an angle $\theta$ to the surface. We use the canonical self-avoiding walk model of polymers and obtain the phase…
Linear polymers adsorbing on a wall can be modelled by half-space self-avoiding walks adsorbing on a line in the square lattice, or on a surface in the cubic lattice. In this paper a numerical approach based on the GAS algorithm is used to…
Prudent walks are self-avoiding walks which cannot step towards an already occupied vertex. We introduce a new model of adsorbing prudent walks on the square lattice, which start on an impenetrable surface and accrue a fugacity $a$ with…
Self-avoiding walk (SAW) represents linear polymer chain on a large scale, neglecting its chemical details and emphasizing the role of its conformational statistics. The role of the latter is important in formation of agglomerates and…
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…
The self-avoiding walk, and lattice spin systems such as the $\varphi^4$ model, are models of interest both in mathematics and in physics. Many of their important mathematical problems remain unsolved, particularly those involving critical…
We consider the phase transition induced by compressing a self-avoiding walk in a slab where the walk is attached to both walls of the slab in two and three dimensions, and the resulting phase once the polymer is compressed. The process of…
We prove several rigorous results about the asymptotic behaviour of the numbers of polygons and self-avoiding walks confined to a square on the square lattice. Specifically we prove that the dominant asymptotic behaviour of polygons…
We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…
Folklore has, that the universal scaling properties of linear polymers in disordered media are well described by the statistics of self-avoiding walks Folklore has, that the universal scaling properties of linear polymers in disordered…
We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour…
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…
We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…
We show that if the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half space and in a sphere. We test these predictions by Monte Carlo simulations and find…
We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force, concentrating on the case of the square lattice. Using series analysis methods we investigate the…
We give exact relations for a number of amplitude combinations that occur in the study of self-avoiding walks, polygons and lattice trails. In particular, we elucidate the lattice-dependent factors which occur in those combinations which…
Self-avoidance is a common mechanism to improve the efficiency of a random walker for covering a spatial domain. However, how this efficiency decreases when self-avoidance is impaired or limited by other processes has remained largely…
We give an algorithm for counting self-avoiding walks or self-avoiding polygons that runs in time $\exp(C\sqrt{n\log n})$ on 2-dimensional lattices and time $\exp(C_dn^{(d-1)/d}\log n)$ on $d$-dimensional lattices for $d>2$.
Counting the number of N-step self-avoiding walks (SAWs) on a lattice is one of the most difficult problems of enumerative combinatorics. Once we give up calculating the exact number of them, however, we have a chance to apply powerful…