Related papers: Compressed self-avoiding walks, bridges and polygo…
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 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…
This is a rather personal review of the problem of self-avoiding walks and polygons. After defining the problem, and outlining what is known rigorously and what is merely conjectured, I highlight the major outstanding problems. I then give…
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the…
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…
We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the free energy is identical when the force is applied at the…
Simulations of the self-avoiding walk (SAW) are performed in a half-plane and a cut-plane (the complex plane with the positive real axis removed) using the pivot algorithm. We test the conjecture of Lawler, Schramm and Werner that the…
The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of…
Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
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 consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force. In this paper the force is applied normal to the surface at the last vertex of the walk. We prove that…
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…
Using exact enumerations of self-avoiding walks (SAWs) we compute the inhomogeneous pressure exerted by a two-dimensional end-grafted polymer on the grafting line which limits a semi-infinite square lattice. The results for SAWs show that…
We consider self-avoiding walks terminally attached to an impenetrable surface at which they can adsorb. We call the vertices farthest away from this plane the top vertices and we consider applying a force at the plane containing the top…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…
We numerically test the correspondence between the scaling limit of self-avoiding walks (SAW) in the plane and Schramm-Loewner evolution (SLE) with k=8/3. We introduce a discrete-time process approximating SLE in the exterior of the unit…
Self-avoiding walks (SAW) are the source of very difficult problems in probabilities and enumerative combinatorics. They are also of great interest as they are, for instance, the basis of protein structure prediction in bioinformatics.…
We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove that this probability measure is also given by the limit as $\beta \rightarrow \beta_c-$ of the probability…