Clustering and cliques in preferential attachment random graphs with edge insertion

DOI10.1007/S10955-024-03279-8zbMATH Open1544.05096MaRDI QIDQ6584875FDOQ6584875

Authors: 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

diametercomplex networkspreferential attachmentcliquesscale-freesmall-worldconcentration bounds

Mathematics Subject Classification ID

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

Cites Work

• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks
• Title not available (Why is that?)
• A general model of web graphs
• Complex graphs and networks
• The diameter of a scale-free random graph
• Counting cycles and finite dimensional \(L^{p}\) norms
• Scale-free network clustering in hyperbolic and other random graphs
• Robustness and Vulnerability of Scale-Free Random Graphs
• The clustering coefficient of a scale-free random graph
• Spread of Infection over P.A. random graphs with edge insertion
• Diameter of P.A. random graphs with edge‐step functions
• Spatial preferential attachment networks: power laws and clustering coefficients
• Large communities in a scale-free network
• 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
• Clustering in preferential attachment random graphs with edge-step
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584875)