Optimal subgraph structures in scale-free configuration models

DOI10.1214/20-AAP1580zbMath1477.05174arXiv1709.03466OpenAlexW3146341627MaRDI QIDQ2240823

Remco van der Hofstad, Clara Stegehuis, Johan S. H. van Leeuwaarden

Publication date: 4 November 2021

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random graphsconfiguration modelsubgraphsmotifs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Asymptotics for cliques in scale-free random graphs, Counting cliques and cycles in scale-free inhomogeneous random graphs, Subgraphs in preferential attachment models, Degree correlations in scale-free random graph models, Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs

Cites Work

• Cliques in hyperbolic random graphs
• Counting triangles in power-law uniform random graphs
• Generating simple random graphs with prescribed degree distribution
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Random Graphs and Complex Networks
• Upper Bounds for Number of Removed Edges in the Erased Configuration Model
• The Probability That a Random Multigraph is Simple
• Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
• Limit theorems for assortativity and clustering in null models for scale-free networks
• Subgraphs in preferential attachment models
• Degree correlations in scale-free random graph models
• The phase transition in inhomogeneous random graphs
• Distances in random graphs with finite variance degrees
• The average distances in random graphs with given expected degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item