Clustering in preferential attachment random graphs with edge-step

DOI10.1017/jpr.2021.20zbMath1479.05321OpenAlexW3215706320MaRDI QIDQ5014300

Rodrigo Ribeiro, Rémy Sanchis, Caio Alves

Publication date: 1 December 2021

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

Full work available at URL: https://doi.org/10.1017/jpr.2021.20

zbMATH Keywords

transitivityclique numbercomplex networksclustering coefficientsconcentration bounds

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Other physical applications of random processes (60K40) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• High-dimensional random geometric graphs and their clique number
• The clustering coefficient of a scale-free random graph
• On tail probabilities for martingales
• Concentration in the generalized Chinese restaurant process
• Spatial preferential attachment networks: power laws and clustering coefficients
• Large communities in a scale-free network
• Random Graphs and Complex Networks
• Large Cliques in a Power-Law Random Graph
• Emergence of Scaling in Random Networks
• Cliques in random graphs
• Robustness and Vulnerability of Scale-Free Random Graphs
• A general model of web graphs
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Clustering in preferential attachment random graphs with edge-step