相关论文: Invariance principles for random bipartite planar …

Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this…

We prove that the metric space associated with a uniformly distributed planar quadrangulation with n faces and no pendant vertices converges modulo a suitable rescaling to the Brownian map. This is a first step towards the extension of…

We prove some asymptotic results for the radius and the profile of large random bipartite planar maps. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted bipartite planar maps and certain two-type trees with positive…

We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…

This paper concerns random bipartite planar maps which are defined by assigning weights to their faces. The paper presents a threefold contribution to the theory. Firstly, we prove the existence of the local limit for all choices of weights…

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…

We consider a random planar map $M_n$ which is uniformly distributed over the class of all rooted q-angulations with n faces. We let $\mathbf{m}_n$ be the vertex set of $M_n$, which is equipped with the graph distance $d_\mathrm{gr}$. Both…

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 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 study the phase diagram of random outerplanar maps sampled according to non-negative Boltzmann weights that are assigned to each face of a map. We prove that for certain choices of weights the map looks like a rescaled version of its…

We consider the model of the Brownian plane, which is a pointed non-compact random metric space with the topology of the complex plane. The Brownian plane can be obtained as the scaling limit in distribution of the uniform infinite planar…

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…

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…

We are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size…

We prove that large Boltzmann stable planar maps of index $\alpha \in (1;2)$ converge in the scaling limit towards a random compact metric space $\mathcal{S}_{\alpha}$ that we construct explicitly. They form a one-parameter family of random…

Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…

We introduce and study a universal model of random geometry in two dimensions. To this end, we start from a discrete graph drawn on the sphere, which is chosen uniformly at random in a certain class of graphs with a given size $n$, for…

We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…

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 discuss scaling limits of large bipartite quadrangulations of positive genus. For a given $g$, we consider, for every $n \ge 1$, a random quadrangulation $\q_n$ uniformly distributed over the set of all rooted bipartite quadrangulations…