Counting cliques and cycles in scale-free inhomogeneous random graphs

DOI10.1007/s10955-019-02248-wzbMath1417.05192arXiv1812.04384OpenAlexW2903647410WikidataQ128363618 ScholiaQ128363618MaRDI QIDQ1999415

Johan S. H. van Leeuwaarden, Vsevolod Shneer, Augustus J. E. M. Janssen

Publication date: 26 June 2019

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.04384

zbMATH Keywords

random graphspower-law distributionscliquesscale-free networkssubgraphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (3)

Asymptotics for cliques in scale-free random graphs ⋮ Phase transitions in a power-law uniform hypergraph ⋮ On the distances within cliques in a soft random geometric graph

Cites Work

• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• Number of cliques in random scale-free network ensembles
• Optimal subgraph structures in scale-free configuration models
• Loops of any size and Hamilton cycles in random scale-free networks
• Degree correlations in scale-free random graph models
• The phase transition in inhomogeneous random graphs
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process

This page was built for publication: Counting cliques and cycles in scale-free inhomogeneous random graphs