Popularity based random graph models leading to a scale-free degree sequence

DOI10.1016/j.disc.2003.10.020zbMath1042.05089OpenAlexW2075946320MaRDI QIDQ1827728

Pierce G. Buckley, Deryk Osthus

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.10.020

zbMATH Keywords

Random graphsWeb graphPower law degreesScale-free degrees

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (22)

Scale-free network clustering in hyperbolic and other random graphs ⋮ Evolution of the Media Web ⋮ Approximability of the vertex cover problem in power-law graphs ⋮ A generalization of the Buckley-Osthus model for web graphs ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ Preferential attachment graphs with co-existing types of different fitnesses ⋮ The three kinds of degree distributions and nash equilibrium on the limiting random network ⋮ Inapproximability of dominating set on power law graphs ⋮ A Geometric Preferential Attachment Model of Networks II ⋮ Assortativity in generalized preferential attachment models ⋮ Small subgraphs in preferential attachment networks ⋮ General results on preferential attachment and clustering coefficient ⋮ Degree distribution of a scale-free random graph model ⋮ Phase transition on the degree sequence of a random graph process with vertex copying and deletion ⋮ The clustering coefficient of a scale-free random graph ⋮ A web model with power law exponents less than 2 ⋮ Disparity of clustering coefficients in the Holme‒Kim network model ⋮ Local Clustering Coefficient in Generalized Preferential Attachment Models ⋮ TheN-star network evolution model ⋮ The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free Graphs ⋮ On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon ⋮ Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metric structure of random networks
• The degree sequence of a scale-free random graph process
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Linearized chord diagrams and an upper bound for vassiliev invariants
• A general model of web graphs

This page was built for publication: Popularity based random graph models leading to a scale-free degree sequence