Related papers: The configurational measure on mutually avoiding S…
In the last few years, new insights have permitted unexpected progress in the study of fractal shapes in two dimensions. A new approach, called Schramm-Loewner evolution, or SLE, has arisen through analytic function theory and probability…
We use the interpretation of the Schramm-Loewner evolution as a limit of path measures tilted by a loop term in order to motivate the definition of $n$-radial SLE going to a particular point. In order to justify the definition we prove that…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
We consider the two-dimensional self-avoiding walk (SAW) in a simply connected domain that contains the origin. The SAW starts at the origin and ends somewhere on the boundary. The distribution of the endpoint along the boundary is expected…
We construct an application, which takes as input a simple path and a possibly infinite collection of loops, and outputs a continuous path by adding the loops chronologically to the simple path as the simple path encounters them. By…
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…
Schramm--Loewner evolution (SLE) has been one of the central topics in the probabilistic study of two-dimensional critical systems. It is a random curve in two dimensions to which a cluster interface in a critical lattice system is…
We define a new ensemble for self-avoiding walks in the upper half-plane, the fixed irredicible bridge ensemble, by considering self-avoiding walks in the upper half-plane up to their $n$-th bridge height, $Y_n$, and scaling the walk by…
We characterize and describe all random subsets $K$ of a given simply connected planar domain (the upper half-plane $\H$, say) which satisfy the ``conformal restriction'' property, i.e., $K$ connects two fixed boundary points (0 and…
We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…
For an integer $k\ge 2$, let $S^{(1)}, S^{(2)}, \dots, S^{(k)}$ be $k$ independent simple symmetric random walks on $\mathbb{Z}$. A pair $(n,z)$ is called a collision event if there are at least two distinct random walks, namely,…
We show that 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. We test these predictions by Monte Carlo simulations and find…
We outline a strategy for showing convergence of loop-erased random walk on the Z^2 square lattice to SLE(2), in the supremum norm topology that takes the time parametrization of the curves into account. The discrete curves are parametrized…
We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the…
Schramm-Loewner Evolutions (SLEs) describe a one-parameter family of growth processes in the plane that have particular conformal invariance properties. For instance, SLE can define simple random curves in a simply connected domain. In this…
Simmons and Cardy recently predicted a formula for the probability that the chordal SLE(8/3) path passes to the left of two points in the upper half-plane. In this paper we give a rigorous proof of their formula. Starting from this result,…
A celebrated problem in numerical analysis is to consider Brownian motion originating at the centre of a $10 \times 1$ rectangle, and to evaluate the ratio of probabilities of a Brownian path hitting the short ends of the rectangle before…
Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…
We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus…
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…