Related papers: Two-sided infinite self-avoiding walk in high dime…
We study three-dimensional self-avoiding walks in presence of a one-dimensional excluded region. We show the appearance of a universal sub-leading exponent which is independent of the particular shape and symmetries of the excluded region.…
We study the path behavior of the anisotropic random walk on the two-dimensional lattice Z^2. Simultaneous strong approximations of its components are given.
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
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…
In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…
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…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
The connective constant mu of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be…
Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but…
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning…
We study the path behavior of the symmetric walk on some special comb-type subsets of ${\mathbb Z}^2$ which are obtained from ${\mathbb Z}^2$ by generalizing the comb having finitely many horizontal lines instead of one.
We solve a model of self-avoiding walks which allows for a site to be visited up to two times by the walk on the Husimi lattice. This model is inspired in the Domb-Joyce model and was proposed to describe the collapse transition of polymers…
The Hammersley-Welsh bound (1962) states that the number $c_n$ of length $n$ self-avoiding walks on $\mathbb{Z}^d$ satisfies \[ c_n \leq \exp \left[ O(n^{1/2}) \right] \mu_c^n, \] where $\mu_c=\mu_c(d)$ is the connective constant of…
In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of…
We study self-avoiding walks on the square lattice restricted to a square box of side $L$ weighted by a length fugacity without restriction of their end points. This models a confined polymer in dilute solution. The model admits a phase…
A proof is presented for the absence of gap for spin $1/2$ ladders with an odd number of legs, in the infinite leg length limit. This result is relevant to the current discussion of coupled one--dimensional spin systems, a physical…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
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…
Kinetically-grown self-avoiding walks have been studied on Watts-Strogatz small-world networks, rewired from a two-dimensional square lattice. The maximum length L of this kind of walks is limited in regular lattices by an attrition effect,…
A self-avoiding walk with small attractive interactions is described here. The existence of the connective constant is established, and the diffusive behavior is proved using the method of the lace expansion.