Related papers: The Smart Kinetic Self-Avoiding Walk and Schramm-L…
Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a…
The uniform spanning tree (UST) and the loop-erased random walk (LERW) are related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the mesh goes to zero. Although the existence of scaling…
Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions $P(k)$ were considered ($k$, degree or connectivity), including scale-free…
The scaling limit of planar loop-erased random walks is described by a stochastic Loewner evolution with parameter kappa=2. In this note SLE(2) in the upper half-plane H minus a simply-connected compact subset K of H is studied. As a main…
This paper is dedicated to the investigation of a $1+1$ dimensional self-interacting and partially directed self-avoiding walk, usually referred to by the acronym IPDSAW and introduced in \cite{ZL68} by Zwanzig and Lauritzen to study the…
A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension.…
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 a real space renormalization-group map for probabilities of random walks on a hierarchical lattice. From this, we study the asymptotic behavior of the end-to-end distance of a weakly self- avoiding random walk (SARW) that…
Loop-erased random walk and it's scaling limit, Schramm--Loewner evolution, have found numerous applications in mathematics and physics. We present a 2 dimensional analogue of LERW, the loop erased random surface. We do this by defining a 2…
The Interacting Growth Walk (IGW) is a kinetic algorithm proposed recently for generating long, compact, self avoiding walks. The growth process in IGW is tuned by the so called growth temperature $T' = 1/(k_B \beta ')$. On a square lattice…
Statistical behavior and scaling properties of iso-height lines in three different saturated two-dimensional grown surfaces with controversial universality classes are investigated using ideas from Schramm-Loewner evolution (SLE$_\kappa$).…
This article is dedicated to the study of the 2-dimensional interacting prudent self-avoiding walk (referred to by the acronym IPSAW) and in particular to its collapse transition. The interaction intensity is denoted by $\beta>0$ and the…
Loop-erased random walk, abbreviated LERW, is one of the most well-studied critical lattice models. It is the self-avoiding random walk one gets after erasing the loops from a simple random walk in order or alternatively by considering the…
Oriented self-avoiding walks (OSAWs) on a square lattice are studied, with binding energies between steps that are oriented parallel across a face of the lattice. By means of exact enumeration and Monte Carlo simulation, we reconstruct the…
We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in…
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…
We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite…
This paper introduces the annulus SLE$_\kappa$ processes in doubly connected domains. Annulus SLE$_6$ has the same law as stopped radial SLE$_6$, up to a time-change. For $\kappa\not=6$, some weak equivalence relation exists between annulus…
We prove that a uniform infinite quadrangulation of the half-plane decorated by a self-avoiding walk (SAW) converges in the scaling limit to the metric gluing of two independent Brownian half-planes identified along their positive boundary…
This paper concerns a random walk on a planar graph and presents certain estimates concerning the harmonic measures for the walk in a grid domain which estimates are useful for showing the convergence of a LERW (loop-erased random walk) to…