Related papers: Self-avoiding walks and polygons confined to a squ…
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…
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of…
We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, $(4.8^2)$, and $(3.12^2)$ lattices. The bound is found by Kesten's method of irreducible bridges. This involves…
We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…
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…
In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…
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.…
Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…
We study the set of directions asymptotically explored by a spatially homogeneous random walk in $d$-dimensional Euclidean space. We survey some pertinent results of Kesten and Erickson, make some further observations, and present some…
We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…
The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails,…
We present simulation results for long ($N\leq 4000$) self-avoiding walks in four dimensions. We find definite indications of logarithmic corrections, but the data are poorly described by the asymptotically leading terms. Detailed…
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…
This is an expository paper on the asymptotic results concerning path behaviour of the anisotropic random walk on the two-dimensional square lattice Z^2. In recent years Mikl\'os and the authors of the present paper investigated the…
We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice $Z^d$. The method is based on loop erasure and restoration, and does not require exact…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding…
We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…
We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…