Subgraphs in preferential attachment models

DOI10.1017/apr.2019.36zbMath1427.05209arXiv1806.10406WikidataQ127322518 ScholiaQ127322518MaRDI QIDQ5203960

Alessandro Garavaglia, Clara Stegehuis

Publication date: 9 December 2019

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

triangle; clustering; subgraph; preferential attachment

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

05C80: Random graphs (graph-theoretic aspects)

Related Items

Subgraphs in preferential attachment models, Dynamical fitness models: evidence of universality classes for preferential attachment graphs, On the chromatic number of the preferential attachment graph, Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs, Optimal subgraph structures in scale-free configuration models

Uses Software

• RAGE
• FANMOD

Cites Work

• Unnamed Item
• Local clustering coefficients in preferential attachment models
• General results on preferential attachment and clustering coefficient
• The clustering coefficient of a scale-free random graph
• A polynomial of graphs on surfaces
• Generating simple random graphs with prescribed degree distribution
• Diameters in preferential attachment models
• 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
• Optimal subgraph structures in scale-free configuration models
• Asymptotic behavior and distributional limits of preferential attachment graphs
• The degree sequence of a scale-free random graph process
• Random Graphs and Complex Networks
• Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The degree sequences and spectra of scale-free random graphs
• Concentration of vertex degrees in a scale‐free random graph process
• Testing for Equivalence of Network Distribution Using Subgraph Counts
• Subgraphs in preferential attachment models
• The average distances in random graphs with given expected degrees