Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition
Abstract
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a consequence, we obtain the convergence of a uniform random graph in such classes to a Brownian limit object in the space of graphons. Our proofs rely on combinatorial arguments, computing generating series using the symbolic method and deriving asymptotics using singularity analysis.
 Publication:

arXiv eprints
 Pub Date:
 October 2023
 DOI:
 10.48550/arXiv.2310.01318
 arXiv:
 arXiv:2310.01318
 Bibcode:
 2023arXiv231001318L
 Keywords:

 Mathematics  Combinatorics;
 Mathematics  Probability;
 05C80;
 60C05;
 05A15;
 05A16
 EPrint:
 32 pages, 11 figures. arXiv admin note: substantial text overlap with arXiv:2301.13607