3 citations · 3 across the 1 of their papers we have counts for
3 papers
math.CO2018
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…
math.CO2017
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…
cs.DS2010★ 3 cited
Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models
Danièle Gardy, Yann Ponty
The present work analyzes the redundancy of sets of combinatorial objects produced by a weighted random generation algorithm proposed by Denise et al. This scheme associates weight…