3 citations · 4 across the 3 of their papers we have counts for
5 papers · 1 filter
Limit Laws of Planar Maps with Prescribed Vertex Degrees
Gwendal Collet, Michael Drmota, Lukas Daniel Klausner
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…
Threshold functions for small subgraphs in simple graphs and multigraphs
Gwendal Collet, Élie de Panafieu, Danièle Gardy +2
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce th…
Threshold functions for small subgraphs: an analytic approach
Gwendal Collet, Élie de Panafieu, Danièle Gardy +2
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on…
Vertex Degrees in Planar Maps
Gwendal Collet, Michael Drmota, Lukas Daniel Klausner
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…
A simple formula for the series of constellations and quasi-constellations with boundaries
Gwendal Collet, Eric Fusy
We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certai…