English
Related papers

Related papers: Universality for the 2D Random Walk Loop Soup

200 papers

The two-dimensional Brownian loop-soup is a Poissonian random collection of loops in a planar domain with an intensity parameter c. When c is not greater than 1, we show that the outer boundaries of the loop clusters are disjoint simple…

Probability · Mathematics 2011-09-29 Scott Sheffield , Wendelin Werner

We prove that uniform random quadrangulations of the sphere with $n$ faces, endowed with the usual graph distance and renormalized by $n^{-1/4}$, converge as $n\to\infty$ in distribution for the Gromov-Hausdorff topology to a limiting…

Probability · Mathematics 2011-05-11 Grégory Miermont

We consider uniform spanning tree (UST) in topological polygons with $2N$ marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants…

Probability · Mathematics 2021-08-25 Mingchang Liu , Hao Wu

The question of understanding the scaling limit of metric graph critical loop soup clusters and its relation to loop soups in the continuum appears to be one of the subtle cases that reveal interesting new scenarios about scaling limits,…

Probability · Mathematics 2026-01-07 Zhenhao Cai , Jian Ding

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…

Probability · Mathematics 2015-08-06 Christian Benes , Gregory F. Lawler , Fredrik Johansson Viklund

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…

Statistical Mechanics · Physics 2018-11-05 Adrien Poncelet

We establish the scaling limit of a class of boundary random walks to the full spectrum of Brownian-type processes on the half-line. By solving the associated martingale problem and employing weak convergence techniques, we prove that under…

Probability · Mathematics 2025-10-03 Juan Carlos Arroyave , Eldon Barros , Eduardo Pimenta

Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…

Probability · Mathematics 2016-01-20 Louigi Addario Berry , Marie Albenque

We establish up-to-constants estimates for arm events in the Brownian loop soup on the 2D metric graph associated with the square lattice. More specifically, we consider two natural geometric events: first, ``bulk'' four-arm events,…

Probability · Mathematics 2025-09-30 Yijie Bi , Yifan Gao , Pierre Nolin , Wei Qian

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…

Probability · Mathematics 2014-10-02 Jiří Černý , Tobias Wassmer

For random collections of self-avoiding loops in two-dimensional domains, we define a simple and natural conformal restriction property that is conjecturally satisfied by the scaling limits of interfaces in models from statistical physics.…

Probability · Mathematics 2017-07-18 Scott Sheffield , Wendelin Werner

We show that the scaling limit exists and is invariant to dilations and rotations. We give some tools that might be useful to show universality.

Probability · Mathematics 2007-05-23 Gady Kozma

For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…

Probability · Mathematics 2015-09-25 Andrew R. Wade , Chang Xu

In this work, which is the first part of a series of two papers, we study the random walk loop soup in dimension two. More specifically, we estimate the probability that two large connected components of loops come close to each other, in…

Probability · Mathematics 2024-09-25 Yifan Gao , Pierre Nolin , Wei Qian

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Probability · Mathematics 2021-12-08 David A. Croydon , Daisuke Shiraishi

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

Combinatorics · Mathematics 2023-10-25 Théo Lenoir

We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…

Probability · Mathematics 2016-09-16 Gérard Ben Arous , Manuel Cabezas , Alexander Fribergh

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…

Probability · Mathematics 2021-01-01 Federico Camia , Alberto Gandolfi , Giovanni Peccati , Tulasi Ram Reddy

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

Probability · Mathematics 2010-01-28 Nicholas Crawford , Allan Sly

Given a bounded Riemann surface $M$ of finite topological type, we show the existence of a universal and conformally invariant scaling limit for the Temperleyan cycle-rooted spanning forest on any sequence of graphs which approximate $M$ in…

Probability · Mathematics 2024-12-11 Nathanaël Berestycki , Benoit Laslier , Gourab Ray