Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
From MaRDI portal
Publication:5491968
DOI10.1080/15427951.2005.10129111zbMath1103.05082WikidataQ56838784 ScholiaQ56838784MaRDI QIDQ5491968
John C. Doyle, Walter Willinger, Lun Li, David Louis Alderson
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
likelihood; self-similarity; Internet; betweenness; degree sequence; assortativity; scale-free networks; SF graphs; structural metric
05C80: Random graphs (graph-theoretic aspects)
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
60C05: Combinatorial probability
05C07: Vertex degrees
Related Items
Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods, A Geometric Preferential Attachment Model of Networks II, Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions, Random graphs with a given degree sequence, Design methodology of networked software evolution growth based on software patterns, Relationship between degree-rank function and degree distribution of protein-protein interaction networks, New method to estimate scaling exponents of power-law degree distribution and hierarchical clustering function for complex networks, The degree distribution of random \(k\)-trees, On the hardness of optimization in power-law graphs, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence, Betweenness Centrality: Extremal Values and Structural Properties, TOPOLOGICAL ANALYSIS OF SPECIFIC SPATIAL COMPLEX NETWORKS
