Related papers: Structural Properties of Self-Attracting Walks
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
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…
Stability and diversity are two key properties that living entities share with spin glasses, where they are manifested through the breaking of the phase space into many valleys or local minima connected by saddle points. The topology of the…
We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS),…
Self-avoiding walks self-interacting via nearest neighbours (ISAW) and self-avoiding trails interacting via multiply-visited sites (ISAT) are two models of the polymer collapse transition of a polymer in dilute solution. On the square…
We study a generalized interacting self-avoiding walk (ISAW) model with nearest- and next nearest-neighbor (NN and NNN) interactions on the square and cubic lattices. In both dimensions, the phase diagrams show coil and globule phases…
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…
There have been separate studies of the polymer collapse transition, where the collapse was induced by two different types of attraction. In each case, the configurations of the polymer were given by the same subset of random walks being…
Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These…
For $d\ge 3$ we construct a new coupling of the trace left by a random walk on a large $d$-dimensional discrete torus with the random interlacements on $\mathbb Z^d$. This coupling has the advantage of working up to macroscopic subsets of…
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…
We provide the exact generating function for semi-flexible and super-flexible interacting partially directed walks and also analyse the solution in detail. We demonstrate that while fully flexible walks have a collapse transition that is…
Based on transfer matrix techniques and finite size scaling, we study the oriented polymer (self-avoiding walk) with nearest neighbor interaction. In the repulsive regime, various critical exponents are computed and compared with exact…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is used to study polymer growth near a $D$-dimensional attractive hyperspherical boundary. The…
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…
We focus on mesoscopic dislocation patterning via a continuum dislocation dynamics theory (CDD) in three dimensions (3D). We study three distinct physically motivated dynamics which consistently lead to fractal formation in 3D with rather…
We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…
We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on…
We use the recently conjectured exact $S$-matrix of the massive ${\rm O}(n)$ model to derive its form factors and ground state energy. This information is then used in the limit $n\to0$ to obtain quantitative results for various universal…
Self-avoiding walks are a simple and well-known model of long, flexible polymers in a good solvent. Polymers being pulled away from a surface by an external agent can be modelled with self-avoiding walks in a half-space, with a Boltzmann…