Related papers: Asymptotics for rooted planar maps and scaling lim…
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…
We study semi-infinite paths of the radial spanning tree (RST) of a Poisson point process in the plane. We first show that the expectation of the number of intersection points between semi-infinite paths and the sphere with radius $r$ grows…
We study the local limits of uniform high genus bipartite maps with prescribed face degrees. We prove the convergence towards a family of infinite maps of the plane, the q-IBPMs, which exhibit both a spatial Markov property and a hyperbolic…
We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…
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…
For every integer $n\geq 1$, we consider a random planar map $\mathcal{M}_n$ which is uniformly distributed over the class of all rooted bipartite planar maps with $n$ edges. We prove that the vertex set of $\mathcal{M}_n$ equipped with the…
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triangulations of the 4-gon with no separating 3-cycle, which are…
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…
We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all surfaces, that is orientable and non-orientable as well. This…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
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…
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…
We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…
Inspired by Stufler's recent probabilistic proof of Otter's asymptotic number of unlabeled trees, we revisit work of Palmer and Schwenk, and study unlabeled forests from a probabilistic point of view. We show that the number of trees in a…
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…
We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…
In the planted bisection model a random graph $G(n,p_+,p_- )$ with $n$ vertices is created by partitioning the vertices randomly into two classes of equal size (up to $\pm1$). Any two vertices that belong to the same class are linked by an…