相关论文: Random Planar Lattices and Integrated SuperBrownia…

Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…

We study a broad class of random labelled trees in which integer-valued labels evolve along the edges according to increments in $\{-1, 0, 1\}$. These models include e.g. branching random walks, embedded complete and incomplete binary…

The aim of this article is to present a growth-fragmentation process naturally embedded in a Brownian excursion from boundary to apex in a cone of angle $2\pi/3$. This growth-fragmentation process corresponds, via the so-called…

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…

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…

The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous's Brownian continuum random tree, the…

We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…

For the directed landscape, the putative universal space-time scaling limit object in the (1+1) dimensional Kardar-Parisi-Zhang (KPZ) universality class, consider the geodesic tree -- the tree formed by the coalescing semi-infinite…

There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…

We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…

We prove that a uniform infinite quadrangulation of the half-plane decorated by a self-avoiding walk (SAW) converges in the scaling limit to the metric gluing of two independent Brownian half-planes identified along their positive boundary…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

Kenyon, Miller, Sheffield, and Wilson (2015) showed how to encode a random bipolar-oriented planar map by means of a random walk with a certain step size distribution. Using this encoding together with the mating-of-trees construction of…

We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…

We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly…

We consider large random planar maps and study the first-passage percolation distance obtained by assigning independent identically distributed lengths to the edges. We consider the cases of quadrangulations and of general planar maps. In…

Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…