English
Related papers

Related papers: Boundary correlations in planar LERW and UST

200 papers

In this paper we establish an exact relationship between the asymptotic probability distributions $\nu_0$ and $\nu_2$ of the multiple point range of the planar random walk and the proper functions $\Gamma^{[0]}$ and $\Gamma^{[2]}$…

Probability · Mathematics 2019-05-02 Daniel Höf

This work describes probabilistic methods for utilizing random spanning trees generated via a random walk process. Goyal et al. showed that the union of random spanning trees approximates the expansion of every cut of a graph. First, we…

Networking and Internet Architecture · Computer Science 2019-10-16 Shlomi Dolev , Daniel Khankin

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

Combinatorics · Mathematics 2015-09-28 Antoine Genitrini , Bernhard Gittenberger , Veronika Kraus , Cécile Mailler

We introduce root-to-leaf path random walks on double covers of graded signed graphs and analyze their behavior in a general setting. Viewing simplicial complexes within this framework, we show that these walks induce the natural…

Combinatorics · Mathematics 2026-05-01 Francesco Viganò , Tolga Birdal , Michael T. Schaub , Mauricio Barahona

In this paper, we provide a framework of estimates for describing 2D scaling limits by Schramm's SLE curves. In particular, we show that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a…

Mathematical Physics · Physics 2015-06-15 Antti Kemppainen , Stanislav Smirnov

We derive a scaling limit in law for the cover time of a simple random walk on a lattice version of a scaled-up planar domain with wired boundary conditions. The limiting distribution is that of a Gumbel Random Variable shifted randomly by…

Probability · Mathematics 2026-02-26 Oren Louidor , Santiago Saglietti

A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection…

Combinatorics · Mathematics 2011-06-24 Richard W. Kenyon , David B. Wilson

In binary and ordinal regression one can distinguish between a location component and a scaling component. While the former determines the location within the range of the response categories, the scaling indicates variance heterogeneity.…

Methodology · Statistics 2019-10-31 Gerhard Tutz , Moritz Berger

We prove up-to-constants estimates for a general class of four-arm events in simple conformal loop ensembles, i.e. CLE$_\kappa$ for $\kappa\in (8/3,4]$. The four-arm events that we consider can be created by either one or two loops, with no…

Probability · Mathematics 2025-04-09 Yifan Gao , Pierre Nolin , Wei Qian

We consider metric graph Gaussian free field (GFF) defined on polygons of $\delta\mathbb{Z}^2$ with alternating boundary data. The crossing probabilities for level-set percolation of metric graph GFF have scaling limits. When the boundary…

Probability · Mathematics 2020-04-21 Mingchang Liu , Hao Wu

We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…

Mathematical Physics · Physics 2010-09-03 J. Bouttier , E. Guitter

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…

Probability · Mathematics 2007-05-23 Gregory F. Lawler , Oded Schramm , Wendelin Werner

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…

Probability · Mathematics 2019-11-20 Christian Beneš , Gregory F. Lawler , Fredrik Viklund

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

Probability · Mathematics 2014-07-01 Rudolf Grübel , Igor Michailow

In this work we consider loop-erased random walk (LERW) and its scaling limit in three dimensions, and prove that 3D LERW parametrized by renormalized length converges to its scaling limit parametrized by some suitable measure with respect…

Probability · Mathematics 2024-11-05 Xinyi Li , Daisuke Shiraishi

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…

Statistical Mechanics · Physics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

We compute the planar limit of both the free energy and the expectation value of the $1/2$ BPS Wilson loop for four dimensional ${\cal N}=2$ superconformal quiver theories, with a product of SU($N$)s as gauge group and bi-fundamental…

High Energy Physics - Theory · Physics 2020-06-16 Bartomeu Fiol , Jairo Martínez-Montoya , Alan Rios Fukelman

We introduce a general technique for proving estimates for certain random planar maps which belong to the $\gamma$-Liouville quantum gravity (LQG) universality class for $\gamma \in (0,2)$. The family of random planar maps we consider are…

Probability · Mathematics 2020-03-12 Ewain Gwynne , Nina Holden , Xin Sun

The probability that a point is to one side of a curve in Schramm-Loewner evolution (SLE) can be obtained alternatively using boundary conformal field theory (BCFT). We extend the BCFT approach to treat two curves, forming, for example, the…

Mathematical Physics · Physics 2007-05-23 Adam Gamsa , John Cardy

We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…

Probability · Mathematics 2023-01-25 Luca Avena , Jannetje Driessen , Twan Koperberg
‹ Prev 1 4 5 6 7 8 10 Next ›