Clustering in preferential attachment random graphs with edge-step

DOI10.1017/JPR.2021.20MaRDI QIDQ5014300zbMATH OpenOpenAlexFDO

Authors Caio Alves, Rodrigo Ribeiro, Rémy Sanchis

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

clique numberclustering coefficientscomplex networksconcentration boundstransitivity

Mathematics Subject Classification ID

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

Recommendations

• Preferential attachment random graphs with edge-step functions
• The distribution of clusters in random graphs
• A random graph model for clustering graphs
• IMPROVED CLUSTERING THROUGH HETEROGENEITY IN PREFERENTIAL ATTACHMENT NETWORKS
• Sparse random graphs with clustering
• Clustering in random line graphs
• Clustering Coefficients of Random Intersection Graphs
• Assortativity and clustering of sparse random intersection graphs
• Statistical Clustering of a Random Network by Extremal Properties
• Scale-free network clustering in hyperbolic and other random graphs

Cites work

• A general model of web graphs
• Cliques in random graphs
• Collective dynamics of `small-world' networks
• Concentration in the generalized Chinese restaurant process
• Emergence of Scaling in Random Networks
• High-dimensional random geometric graphs and their clique number
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Large cliques in a power-law random graph
• Large communities in a scale-free network
• On tail probabilities for martingales
• Random graphs and complex networks. Volume 1
• Robustness and Vulnerability of Scale-Free Random Graphs
• Spatial preferential attachment networks: power laws and clustering coefficients
• The clustering coefficient of a scale-free random graph

Cited in

(3)

• Large communities in a scale-free network
• IMPROVED CLUSTERING THROUGH HETEROGENEITY IN PREFERENTIAL ATTACHMENT NETWORKS
• Clustering and cliques in preferential attachment random graphs with edge insertion

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

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