Related papers: Square lattice self-avoiding walks and biased diff…
This paper proves the long-standing open conjecture rooted in chemical physics (Flory (1949)) that the self-avoiding walk (SAW) in the square lattice has root mean square displacement exponent \nu= 3/4. This value is an instance of the…
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…
The self-avoiding walk on the square site-diluted correlated percolation lattice is considered. The Ising model is employed to realize the spatial correlations of the metric space. As a well-accepted result, the (generalized) Flory's mean…
We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…
We present further results on a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle, supplementing those in a previous paper (McPhedran {\em et…
We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…
Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
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…
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…
A new algorithm for the derivation of low-density expansions has been used to greatly extend the series for moments of the pair-connectedness on the directed square lattice near an impenetrable wall. Analysis of the series yields very…
The time it takes a random walker in a lattice to reach the origin from another vertex $x$, has infinite mean. If the walker can restart the walk at $x$ at will, then the minimum expected hitting time $T(x,0)$ (minimized over restarting…
In a 1976 paper published in Science, Knuth presented an algorithm to sample (non-uniform) self-avoiding walks crossing a square of side k. From this sample, he constructed an estimator for the number of such walks. The quality of this…
We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
We study the two-point functions of a general class of random-length random walks on finite boxes in $\ZZ^d$ with $d\ge3$, and provide precise asymptotics for their behaviour. We show that the finite-box two-point function is asymptotic to…
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…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
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…
We show how the theory of the critical behaviour of $d$-dimensional polymer networks gives a scaling relation for self-avoiding {\em bridges} that relates the critical exponent for bridges $\gamma_b$ to that of terminally-attached…