相关论文: The Brownian Cactus I. Scaling limits of discrete …

The Brownian map is a random geodesic metric space arising as the scaling limit of random planar maps. We strengthen the so-called confluence of geodesics phenomenon observed at the root of the map, and with this, reveal several properties…

We study properties of the random metric space called the Brownian map. For every h>0, we consider the connected components of the complement of the open ball of radius h centered at the root, and we let N(h,r) be the number of those…

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…

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 introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

We present different continuous models of random geometry that have been introduced and studied in the recent years. In particular, we consider the Brownian map, which is the universal scaling limit of large planar maps in the…

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…

In this last decade, an important stochastic model emerged: the Brownian map. It is the limit of various models of random combinatorial maps after rescaling: it is a random metric space with Hausdorff dimension 4, almost surely homeomorphic…

We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform $p$-angulations. As their number of vertices $n$ goes to infinity, we…

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…

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…

We introduce and study the random non-compact metric space called the Brownian plane, which is obtained as the scaling limit of the uniform infinite planar quadrangulation. Alternatively, the Brownian plane is identified as the…

We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by…

We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…

The Brownian tree, also known as the continuum random tree, is a canonical random compact, geodesic $\mathbf R$-tree that arises as the universal scaling limit for numerous models of discrete random trees. A key quasisymmetric invariant of…

A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a $k$-cactus is a connected graph in which each edge is contained in at most $k$ cycles where $k\ge 1$. It…

Consider $q_n$ a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with $n$ faces. In this paper we show that, when $n$ goes to $+\infty$, $q_n$ suitably normalized converges weakly in a certain sense…

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…

We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…