Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
From MaRDI portal
Publication:5491968
Recommendations
Cited in
(45)- When is a scale-free graph ultra-small?
- The architecture of connectivity: a key to network vulnerability, complexity and resilience
- Are RNA networks scale-free?
- Tell me who you are friends with and I will tell you who you are: unique neighborhoods in random graphs
- Directed and non-directed scale-free networks
- Estimation of graphical models through structured norm minimization
- Scale free interval graphs
- Algorithms for recursive delegation
- Using cellular automata on a graph to model the exchanges of cash and goods
- Axioms for Centrality
- Betweenness Centrality: Extremal Values and Structural Properties
- The correlation of the degrees of Bernoulli random graphs
- Scale Free Interval Graphs
- Simple epidemic network model for highly heterogeneous populations
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
- Random graphs with a given degree sequence
- A MULTILAYER VIEW OF SYSTEMIC IMPORTANCE AND AGGREGATE FLUCTUATIONS
- The accumulative law and its probability model: an extension of the Pareto distribution and the log-normal distribution
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Condition numbers and scale free graphs
- Design methodology of networked software evolution growth based on software patterns
- The degree distribution of random \(k\)-trees
- 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
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Structural properties of the scale-free Barabasi-Albert graph
- On the hardness of optimization in power-law graphs
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization
- On balanced sets in scale-free networks (graphs)
- New analytical lower bounds on the clique number of a graph
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming
- Cliques in hyperbolic random graphs
- Extremal properties of graphs and eigencentrality in trees with a given degree sequence
- A Geometric Preferential Attachment Model of Networks II
- The ``cameo principle and the origin of scale-free graphs in social networks
- Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
- Scale-free networks: basic theory and applied research
- Mitigation of complex behavior over networked systems: analysis of spatially invariant structures
- 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
- TOPOLOGICAL ANALYSIS OF SPECIFIC SPATIAL COMPLEX NETWORKS
- Detecting different topologies immanent in scale-free networks with the same degree distribution
- Time-varying network models
- Higher order assortativity in complex networks
- The theory of \(s_{\max}\) graph does not seem to work in a real case study
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)
