Clustering and cliques in preferential attachment random graphs with edge insertion

DOI10.1007/s10955-024-03279-8zbMATH Open1544.05096MaRDI QIDQ6584875

Caio Alves, Rodrigo Ribeiro, Rémy Sanchis

Publication date: 8 August 2024

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

zbMATH Keywords

diametercliquescomplex networkspreferential attachmentscale-freesmall-worldconcentration bounds

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Other physical applications of random processes (60K40)

Cites Work

• Unnamed Item
• Unnamed Item
• The clustering coefficient of a scale-free random graph
• Counting cycles and finite dimensional \(L^{p}\) norms
• The diameter of a scale-free random graph
• Detecting a planted community in an inhomogeneous random graph
• Preferential attachment random graphs with edge-step functions
• Cliques in rank-1 random graphs: the role of inhomogeneity
• Spatial preferential attachment networks: power laws and clustering coefficients
• Large communities in a scale-free network
• Emergence of Scaling in Random Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• A general model of web graphs
• Clustering in preferential attachment random graphs with edge-step
• Spread of Infection over P.A. random graphs with edge insertion
• Scale-free network clustering in hyperbolic and other random graphs
• Diameter of P.A. random graphs with edge‐step functions
• Collective dynamics of ‘small-world’ networks
• Asymptotic results of a multiple-entry reinforcement process

This page was built for publication: Clustering and cliques in preferential attachment random graphs with edge insertion