Related papers: Monte Carlo Tests of SLE Predictions for the 2D Se…
Various features of the two-parameter family of Schramm-Loewner evolutions SLE(\kappa,\rho) are studied. In particular, we derive certain restriction properties that lead to a ``strong duality'' conjecture, which is an identity in law…
We prove a sufficient condition for the two-point function of a statistical mechanical model on $\mathbb{Z}^d$, $d > 2$, to be bounded uniformly near a critical point by $|x|^{-(d-2)} \exp [ -c|x| / \xi ]$, where $\xi$ is the correlation…
We establish an upper bound on the asymptotic probability of an SLE(kappa) curve hitting two small intervals on the real line as the interval width goes to zero, for the range 4 < kappa < 8. As a consequence we are able to prove that the…
We present a mathematical proof of theoretical predictions made by Arguin and Saint-Aubin, as well as by Bauer, Bernard, and Kytola, about certain non-local observables for the two-dimensional Ising model at criticality by combining…
We give estimates for the probability that a chordal, radial or two-sided radial SLE$_\kappa$ curve retreats far from its terminal point after coming close to it, for $\kappa \leq 4$. The estimates are uniform over all initial segments of…
Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is $\sqrt{2+\sqrt{2}}.$ A key identity used in that proof depends on the…
We give a new proof of a result of Kenyon that the growth exponent for loop-erased random walks in two dimensions is 5/4. The proof uses the convergence of LERW to Schramm-Loewner evolution with parameter 2, and is valid for irreducible…
We perform a Monte Carlo study of $N$-step self-avoiding walks, attached to the corner of an impenetrable wedge in two dimensions ($d=2$), or the tip of an impenetrable cone in $d=3$, of sizes ranging up to $N=10^6$ steps. We find that the…
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…
We consider long-range percolation, Ising model, and self-avoiding walk on $\mathbb{Z}^d$, with couplings decaying like $|x|^{-(d+\alpha)}$ where $0 < \alpha \le 2$, above the upper critical dimensions. In the spread-out setting where the…
We study crossover phenomena in a model of self-avoiding walks with medium-range jumps, that corresponds to the limit $N\to 0$ of an $N$-vector spin system with medium-range interactions. In particular, we consider the critical crossover…
A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…
In order to study long chain polymers many lattice models accommodate a pulling force applied to a particular part of the chain, often a free endpoint. This is in addition to well-studied features such as energetic interaction between the…
We review two numerical methods related to the Schramm-Loewner evolution (SLE). The first simulates SLE itself. More generally, it finds the curve in the half-plane that results from the Loewner equation for a given driving function. The…
Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersections. On $\mathbb{Z}$, Greven and den Hollander proved in 1993 that the discrete-time weakly self-avoiding walk has an asymptotically…
By analogy with Carleson's observation on Cardy's formula describing crossing probabilities for the scaling limit of critical percolation, we exhibit ``privileged geometries'' for Stochastic Loewner Evolutions with various parameters, for…
This article is a pedagogical review of Monte Carlo methods for the self-avoiding walk, with emphasis on the extraordinarily efficient algorithms developed over the past decade.
For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…
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.…
Stochastic Loewner Evolution (SLE_kappa) has been introduced as a description of the continuum limit of cluster boundaries in two-dimensional critical systems. We show that the problem of N radial SLEs in the unit disc is equivalent to…