Related papers: Bivariate asymptotics via random walks: applicatio…
We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…
We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…
In this paper, we use a formula obtained in [8] to study certain asymptotic behaviors of GUE (Gaussian unitary ensemble) correlators. More precisely, we obtain large genus asymptotics of enumerations of ordinary graphs and ribbon graphs…
We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences 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 propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
In a mixed generalized linear model, the goal is to learn multiple signals from unlabeled observations: each sample comes from exactly one signal, but it is not known which one. We consider the prototypical problem of estimating two…
Making use of large-order techniques in asymptotics and resurgent analysis, this work addresses the growth of enumerative Gromov-Witten invariants---in their dependence upon genus and degree of the embedded curve---for several different…
The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…
We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…
We study the geometry of a random unicellular map which is uniformly distributed on the set of all unicellular maps whose genus size is proportional to the number of edges of the map. We prove that the distance between two uniformly…
We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…