Related papers: Scaling limits of random outerplanar maps with ind…

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains…

Recently, a tree bijection has been found for planar hyperbolic surfaces, which allows for an easy computation of the Weil--Petersson volumes, and opens the path to get distance statistic on random hyperbolic surfaces and to find scaling…

In this paper, we obtain optimal uniform lower tail estimates for the probability distribution of the properly scaled length of the longest up/right path of the last passage site percolation model considered by Johansson in [12]. The…

The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for…

We develop a new probabilistic method for deriving deviation estimates in directed planar polymer and percolation models. The key estimates are for exit points of geodesics as they cross transversal down-right boundaries. These bounds are…

Baxter permutations, plane bipolar orientations, and a specific family of walks in the non-negative quadrant, called tandem walks, are well-known to be related to each other through several bijections. We introduce a further new family of…

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…

In this work, we introduce a random field in view of natural image modeling, obtained as a limit of sequences of dead leaves models, when considering arbitrarily small or big objects. The dead leaves model, introduced by the Mathematical…

We introduce a general technique for proving estimates for certain random planar maps which belong to the $\gamma$-Liouville quantum gravity (LQG) universality class for $\gamma \in (0,2)$. The family of random planar maps we consider are…

We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…

We compute a number of distance-dependent universal scaling functions characterizing the distance statistics of large maps of genus one. In particular, we obtain explicitly the probability distribution for the length of the shortest…

We consider a Tamari interval of size $n$ (i.e., a pair of Dyck paths which are comparable for the Tamari relation) chosen uniformly at random. We show that the height of a uniformly chosen vertex on the upper or lower path scales as…

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive…

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…

The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…

We define a minimization problem for paths on planar graphs that, on the honeycomb lattice, is equivalent to the exploration path of the critical site percolation and than has the same scaling limit of SLE_6. We numerically study this model…

We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and…

We prove that geodesic rays in the Uniform Infinite Planar Triangulation (UIPT) coalesce in a strong sense using the skeleton decomposition of random triangulations discovered by Krikun. This implies the existence of a unique horofunction…