General results on preferential attachment and clustering coefficient

DOI10.1007/S11590-016-1030-8zbMath1369.90020OpenAlexW2327056132MaRDI QIDQ526411

Liudmila Ostroumova Prokhorenkova

Publication date: 12 May 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-016-1030-8

zbMATH Keywords

networksclustering coefficientpreferential attachmentrandom graph modelspower-law degree distribution

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Exact modularity of line graphs of complete graphs ⋮ New lower bound on the modularity of Johnson graphs ⋮ Clustering coefficient of a spatial preferential attachment model ⋮ Subgraphs in preferential attachment models ⋮ New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An estimate for the number of edges between vertices of gives degrees in random graphs in the Bollobás-Riordan model
• Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
• The clustering coefficient of a scale-free random graph
• Generating simple random graphs with prescribed degree distribution
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Popularity based random graph models leading to a scale-free degree sequence
• Complex networks: structure and dynamics
• The degree sequence of a scale-free random graph process
• Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
• Global Clustering Coefficient in Scale-Free Networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• The Maximum Degree of the Barabási–Albert Random Tree
• A critical point for random graphs with a given degree sequence
• Degree Distribution and Number of Edges between Nodes of Given Degrees in the Buckley–Osthus Model of a Random Web Graph
• Collective dynamics of ‘small-world’ networks
• Global Clustering Coefficient in Scale-Free Weighted and Unweighted Networks
• Local Clustering Coefficient in Generalized Preferential Attachment Models

This page was built for publication: General results on preferential attachment and clustering coefficient