Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
DOI10.1080/15427951.2005.10129111zbMATH Open1103.05082OpenAlexW1987236914WikidataQ56838784 ScholiaQ56838784MaRDI QIDQ5491968FDOQ5491968
Authors: Lun Li, David Louis Alderson, John C. Doyle, Walter Willinger 
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
Recommendations
likelihoodself-similaritydegree sequencebetweennessassortativityscale-free networksInternetSF graphsstructural metric
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Vertex degrees (05C07) Network design and communication in computer systems (68M10)
Cited In (41)
- Random graphs with a given degree sequence
- THE CORRELATION OF THE DEGREES OF BERNOULLI RANDOM GRAPHS
- 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
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
- The accumulative law and its probability model: an extension of the Pareto distribution and the log-normal distribution
- Condition numbers and scale free graphs
- The ``cameo principle and the origin of scale-free graphs in social networks
- Design methodology of networked software evolution growth based on software patterns
- Higher order assortativity in complex networks
- Scale Free Interval Graphs
- Time-varying network models
- Using cellular automata on a graph to model the exchanges of cash and goods
- Cliques in hyperbolic random graphs
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Directed and non-directed scale-free networks
- Betweenness Centrality: Extremal Values and Structural Properties
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming
- Scale-free networks: basic theory and applied research
- On the hardness of optimization in power-law graphs
- Algorithms for recursive delegation
- TOPOLOGICAL ANALYSIS OF SPECIFIC SPATIAL COMPLEX NETWORKS
- Estimation of Graphical Models through Structured Norm Minimization
- When is a scale-free graph ultra-small?
- Simple epidemic network model for highly heterogeneous populations
- Scale free interval graphs
- New analytical lower bounds on the clique number of a graph
- Extremal properties of graphs and eigencentrality in trees with a given degree sequence
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
- Topological Analysis of Bitcoin’s Lightning Network
- Power-law distribution of degree–degree distance: A better representation of the scale-free property of complex networks
- The degree distribution of random \(k\)-trees
- A MULTILAYER VIEW OF SYSTEMIC IMPORTANCE AND AGGREGATE FLUCTUATIONS
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization
- A Geometric Preferential Attachment Model of Networks II
- The theory of \(s_{\max}\) graph does not seem to work in a real case study
- 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
- Axioms for Centrality
- Mitigation of complex behavior over networked systems: analysis of spatially invariant structures
This page was built for publication: Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491968)
