Related papers: Brownian paths as loop-decorated SLEs
A simple random walk and a Brownian motion are considered on a spider that is a collection of half lines (we call them legs) joined in the origin. We give a strong approximation of these two objects and their local times. For fixed number…
We consider the limit behavior of a one-dimensional random walk with unit jumps whose transition probabilities are modified every time the walk hits zero. The invariance principle is proved in the scheme of series where the size of…
We construct a coupling between a massive GFF and a random curve in which the curve can be interpreted as the level line of the field and has the law of massive SLE$_4$. This coupling is obtained by reweighting the law of the standard…
Following the strategy proposed by Makarov and Smirnov in arXiv:0909.5377, we provide technical details for the proof of convergence of massive loop-erased random walks to the chordal mSLE(2) process. As no follow-up of arXiv:0909.5377…
Standard Schramm-Loewner evolution (SLE) is driven by a continuous Brownian motion which then produces a trace, a continuous fractal curve connecting the singular points of the motion. If jumps are added to the driving function, the trace…
The Brownian excursion measure is a conformally invariant infinite measure on curves. It figured prominently in one of the first major applications of SLE, namely the explicit calculations of the planar Brownian intersection exponents from…
We revisit the computation of the discrete version of Schramm's formula for the loop-erased random walk derived by Kenyon. The explicit formula in terms of the Green function relies on the use of a complex connection on a graph, for which a…
In this paper we consider the natural random walk on a planar graph and scale it by a small positive number $\delta$. Given a simply connected domain $D$ and its two boundary points $a$ and $b$, we start the scaled walk at a vertex of the…
We study vertex-like operators built from the Brownian loop soup in the limit as the loop soup intensity tends to infinity. More precisely, following Camia, Gandolfi and Kleban (Nuclear Physics B 902, 2016), we take a Brownian loop soup in…
We give a construction of an infinite stable looptree, which we denote by $\mathcal{L}_{\alpha}^{\infty}$, and prove that it arises both as a local limit of the compact stable looptrees of Curien and Kortchemski (2015), and as a scaling…
Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…
We give the exact solution to the problem of a random walk on the Bethe lattice through a mapping on an asymmetric random walk on the half-line. We also study the continuous limit of this model, and discuss in detail the relation between…
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the…
The primary purpose of this article is to prove a tightness of skew random walks. The tightness result implies, in particular, that the skew Brownian motion can be constructed as the scaling limit of such random walks. Our proof of…
We study the convergence in rough path topology of a certain class of discrete processes, the hidden Markov walks, to a Brownian motion with an area anomaly. This area anomaly, which is a new object, keeps track of the time-correlation of…
Let $S_n$ be a lattice random walk with mean zero and finite variance, and let $\Lambda^a_n$ be its occupation measure at level $a$. In this note, we prove local limit theorems for $\Pr[S_n=x,\Lambda^a_n=\ell]$ and…
We give a complete classification of scaling limits of randomly trapped random walks and associated clock processes on $\mathbb Z^d$, $d\ge 2$. Namely, under the hypothesis that the discrete skeleton of the randomly trapped random walk has…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…