Threshold functions for small subgraphs in simple graphs and multigraphs

Abstract : 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 the notion of patchworks to describe the possible overlappings of copies of subgraphs. Furthermore, the proofs are based on analytic combinatorics to carry out asymptotic computations. The flexibility of our approach allows us to tackle a wide range of problems. We obtain the asymptotic number and the limiting distribution of the number of subgraphs which are isomorphic to a graph from a given set of graphs. The results apply to multigraphs as well as to (multi)graphs with degree constraints. One application is to scale-free multigraphs, where the degree distribution follows a power law, for which we show how to obtain the asymptotic number of copies of a given subgraphs and give as an illustration the expected number of small cycles.
Complete list of metadatas

Cited literature [48 references]  Display  Hide  Download
Contributor : Danièle Gardy <>
Submitted on : Wednesday, August 1, 2018 - 7:14:55 AM
Last modification on : Thursday, April 4, 2019 - 1:26:42 AM
Long-term archiving on : Friday, November 2, 2018 - 12:28:10 PM


main_subgraphs_journal (1).pdf
Files produced by the author(s)


  • HAL Id : hal-01847358, version 2


Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana. Threshold functions for small subgraphs in simple graphs and multigraphs. 2018. ⟨hal-01847358v2⟩



Record views


Files downloads