Related papers: The snake in the Brownian sphere

In this paper we propose a method for computing the contour of an object in an image using a snake represented as a subdivision curve. The evolution of the snake is driven by its control points which are computed minimizing an energy that…

Over the past few decades, two natural random surface models have emerged within physics and mathematics. The first is Liouville quantum gravity, which has its roots in string theory and conformal field theory from the 1980s and 1990s. The…

The Brownian web is a random object that occurs as the scaling limit of an infinite system of coalescing random walks. Perturbing this system of random walks by, independently at each point in space-time, resampling the random walk…

Previous works in this series have shown that an instance of a $\sqrt{8/3}$-Liouville quantum gravity (LQG) sphere has a well-defined distance function, and that the resulting metric measure space (mm-space) agrees in law with the Brownian…

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 introduce and study a new random surface which we call the hyperbolic Brownian plane and which is the near-critical scaling limit of the hyperbolic triangulations constructed in arXiv:1401.3297. The law of the hyperbolic Brownian plane…

We derive a new representation of the Brownian disk in terms of a forest of labeled trees, where labels correspond to distances from a subset of the boundary. We then use this representation to obtain a spatial Markov property showing that…

Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree ${\cal T}^{\mathrm{br}}$. The associated cut tree cut$({\cal T}^{\mathrm{br}})$, introduced by Bertoin and Miermont…

The kinetic Brownian motion on the sphere bundle of a Riemannian manifold $M$ is a stochastic process that models a random perturbation of the geodesic flow. If $M$ is a orientable compact constantly curved surface, we show that in the…

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…

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,…

We revise the Levy's construction of Brownian motion as a simple though still rigorous approach to operate with various Gaussian processes. A Brownian path is explicitly constructed as a linear combination of wavelet-based "geometrical…

We prove that a uniform, rooted unordered binary tree with $n$ vertices has the Brownian continuum random tree as its scaling limit for the Gromov-Hausdorff topology. The limit is thus, up to a constant factor, the same as that of uniform…

The main topic of these lecture notes is the continuum scaling limit of planar lattice models. One reason why this topic occupies an important place in the theory of probability and mathematical statistical physics is that scaling limits…

We give bijections between bipolar-oriented (acyclic with unique source and sink) planar maps and certain random walks, which show that the uniformly random bipolar-oriented planar map, decorated by the "peano curve" surrounding the tree of…

Given a general critical or sub-critical branching mechanism and its associated L\'evy continuum random tree, we consider a pruning procedure on this tree using a Poisson snake. It defines a fragmentation process on the tree. We compute the…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we…

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…