Searcharxiv⌕ Search

arXiv subjects

Gregory F. Lawler

Publications and source records attributed to Gregory F. Lawler.

At least 19 recordsLinked to original sources
arXiv2022

N-sided Radial Schramm-Loewner Evolution

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 the measure obtained by an appropriately normalized loop term on $n$-tuples of paths has a limit. The limit measure can be described as $n$ paths moving by the Loewner equation with a driving term of Dyson Brownian motion. While the limit process has been considered before, this paper shows why it naturally arises as a limit of configurational measures obtained from loop measures.

math.PR↗
arXiv2021

Minkowski content of Brownian cut points

Let $W(t)$, $0\leq t\leq T$, be a Brownian motion in $\mathbb{R}^d$, $d=2,3$. We say that $x$ is a cut point for $W$ if $x=W(t)$ for some $t\in(0,T)$ such that $W [0,t) $ and $W (t,T]$ are disjoint. In this work, we prove that a.s. the Minkowski content of the set of cut points for $W$ exists and is finite and non-trivial.

math.PR↗
arXiv2020

Harry Kesten (1931-2019), a personal and scientific tribute

The mathematical achievements of Harry Kesten since the mid-1950s have revolutionized probability theory as a subject in its own right and in its associations with aspects of algebra, analysis, geometry, and statistical physics. Through his personality and scientific ability, he has framed the modern subject to a degree exceeded by no other. The impact of his work and personality is summarised in this memoir.

math.HO↗
arXiv2019

Transition probabilities for infinite two-sided loop-erased random walks

The infinite two-sided loop-erased random walk (LERW) is a measure on infinite self-avoiding walks that can be viewed as giving the law of the `middle part' of an infinite LERW loop going through 0 and infinity. In this note we derive expressions for transition probabilities for this model in dimensions two and up. In the plane, the formula can be further expressed in terms of a Laplacian with signed weights acting on certain discrete harmonic functions at the tips of the walk, and taking a determinant. The discrete harmonic functions are closely related to a discrete version of the complex square-root.

math.PR↗
arXiv2018

Multiple-paths $SLE_κ$ in multiply connected domains

We define multiple-paths Schramm-Loewner evolution ($SLE_κ$) in multiply connected domains when $κ\leq 4$ and prove that in annuli, the partition function is smooth. Moreover, we give up-to-constant estimates for the partition function of bi-chordal annulus $SLE_κ$ measure and we establish a connection between this measure and two-sided $SLE_κ$ in the unit disk.

math.PR↗
arXiv2018

Four dimensional loop-erased random walk

The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost surely and in $L^{p}$ for all $p>0$. Along the way, we extend previous results by the first author building on slowly recurrent sets. We provide two applications for the escape probability. We construct the two-sided LERW, and we construct a $\pm 1$ spin model coupled with the wired spanning forests on $\mathbb{Z}^4$ with the bi-Laplacian Gaussian field on $\mathbb{R}^{4}$ as its scaling limit.

math.PR↗
arXiv2018

Weighted graphs and complex Gaussian free fields

We prove a combinatorial lemma about the distribution of directed currents in a complex "loop soup" and use it to give a new proof of the isomorphism relating loop measures and complex Gaussian fields.

math.PR↗
arXiv2018

The infinite two-sided loop-erased random walk

The loop-erased random walk (LERW) in $ \Z^d, d \geq 2$, is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the "middle" of the path.

math.PR↗
arXiv2017

Topics in loop measures and the loop-erased walk

These are notes based on a course that I gave at the University of Chicago in Fall 2016 on "Loop measures and the loop-erased random walk." This is not intended to be a comprehensive view but rather a personal selection of some key ideas including some recent results.

math.PR↗
arXiv2017

The Loewner difference equation and convergence of loop-erased random walk

We revisit the convergence of loop-erased random walk, LERW, to SLE(2) when the curves are parametrized by capacity. We construct a coupling of the chordal version of LERW and chordal SLE(2) based on the Green's function for LERW as martingale observable and using an elementary discrete-time Loewner "difference" equation. This coupling is different than the ones previously considered in this context. Our recent work (arXiv:1603.05203) on the convergence of LERW parametrized by length to SLE(2) parameterized by Minkowski content uses specific features of the coupling constructed here.

math.PR↗
arXiv2017

Convergence of radial loop-erased random walk in the natural parametrization

In recent work we have shown that loop-erased random walk (LERW) connecting two boundary points of a domain converges to the chordal Schramm-Loewner evolution (SLE(2)) in the sense of curves parametrized by Minkowski content. In this note we explain how to derive the analogous result for LERW from a boundary point to an interior point, converging towards radial SLE(2).

math.PR↗
arXiv2016

Convergence of loop-erased random walk in the natural parametrization

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 branches in a uniformly chosen spanning tree. This paper proves that planar LERW parametrized by renormalized length converges in the lattice size scaling limit to SLE(2) parametrized by 5/4-dimensional Minkowski content. In doing this we also provide a method for proving similar convergence results for other models converging to SLE. Besides the main theorem, several of our results about LERW are of independent interest: for example, two-point estimates, estimates on maximal content, and a "separation lemma".

math.PR↗
arXiv2015

Compressed self-avoiding walks, bridges and polygons

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 boundary of the half-space. In the case of bridges, this is the unique end-point. In the case of SAWs or self-avoiding polygons, this corresponds to all vertices of maximal height. We first use the conjectured relation with the Schramm-Loewner evolution to predict the form of the partition function including the values of the exponents, and then we use series analysis to test these predictions.

math-ph↗
arXiv2015

Scaling limit of the loop-erased random walk Green's function

We consider loop-erased random walk (LERW) running between two boundary points of a square grid approximation of a planar simply connected domain. The LERW Green's function is the probability that the LERW passes through a given edge in the domain. We prove that this probability, multiplied by the inverse mesh size to the power 3/4, converges in the lattice size scaling limit to (a constant times) an explicit conformally covariant quantity which coincides with the SLE(2) Green's function. The proof does not use SLE techniques and is based on a combinatorial identity which reduces the problem to obtaining sharp asymptotics for two quantities: the loop measure of random walk loops of odd winding number about a branch point near the marked edge and a "spinor" observable for random walk started from one of the vertices of the marked edge.

math.PR↗