Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications

DOI10.1080/15427951.2005.10129111zbMath1103.05082OpenAlexW1987236914WikidataQ56838784 ScholiaQ56838784MaRDI QIDQ5491968

David Louis Alderson, Walter Willinger, Lun Li, John C. Doyle

Publication date: 12 October 2006

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

Full work available at URL: https://doi.org/10.1080/15427951.2005.10129111

zbMATH Keywords

likelihood self-similarity Internet betweenness degree sequence assortativity scale-free networks SF graphs structural metric

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Vertex degrees (05C07)

Related Items

Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming ⋮ Power-law distribution of degree–degree distance: A better representation of the scale-free property of complex networks ⋮ Design methodology of networked software evolution growth based on software patterns ⋮ Higher order assortativity in complex networks ⋮ Symmetry-driven network reconstruction through pseudobalanced coloring optimization ⋮ A MULTILAYER VIEW OF SYSTEMIC IMPORTANCE AND AGGREGATE FLUCTUATIONS ⋮ Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions ⋮ The architecture of connectivity: a key to network vulnerability, complexity and resilience ⋮ Tell me who you are friends with and I will tell you who you are: unique neighborhoods in random graphs ⋮ Techniques for analyzing dynamic random graph models of web-like networks: An overview ⋮ Random graphs with a given degree sequence ⋮ Topological Analysis of Bitcoin’s Lightning Network ⋮ Relationship between degree-rank function and degree distribution of protein-protein interaction networks ⋮ Algorithms for recursive delegation ⋮ New method to estimate scaling exponents of power-law degree distribution and hierarchical clustering function for complex networks ⋮ A Geometric Preferential Attachment Model of Networks II ⋮ The accumulative law and its probability model: an extension of the Pareto distribution and the log-normal distribution ⋮ Mitigation of complex behavior over networked systems: analysis of spatially invariant structures ⋮ Estimation of Graphical Models through Structured Norm Minimization ⋮ On the hardness of optimization in power-law graphs ⋮ Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence ⋮ Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods ⋮ Betweenness Centrality: Extremal Values and Structural Properties ⋮ Cliques in hyperbolic random graphs ⋮ Simple epidemic network model for highly heterogeneous populations ⋮ Time-varying network models ⋮ Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree ⋮ The degree distribution of random \(k\)-trees ⋮ THE CORRELATION OF THE DEGREES OF BERNOULLI RANDOM GRAPHS ⋮ TOPOLOGICAL ANALYSIS OF SPECIFIC SPATIAL COMPLEX NETWORKS ⋮ Axioms for Centrality ⋮ Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees ⋮ New analytical lower bounds on the clique number of a graph

This page was built for publication: Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications