Exactly scale-free scale-free networks
From MaRDI portal
Publication:1618532
DOI10.1016/j.physa.2015.03.074zbMath1400.90075arXiv1309.0961OpenAlexW2964246775MaRDI QIDQ1618532
Michael Small, Linjun Zhang, Kevin Judd
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0961
Related Items
Parameter specification for the degree distribution of simulated Barabási-Albert graphs ⋮ Failure analysis of network nodes and edges in scale-free networks ⋮ The SEIRS-C model of information diffusion based on rumour spreading with fuzzy logic in social networks ⋮ Network model with scale-free, high clustering coefficients, and small-world properties
Uses Software
Cites Work
- Some things we've learned (about Markov chain Monte Carlo)
- Generating simple random graphs with prescribed degree distribution
- Analysis of a nonreversible Markov chain sampler.
- Emergence of Scaling in Random Networks
- A remark on the existence of finite graphs
- Power-Law Distributions in Empirical Data
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- The Structure and Function of Complex Networks
- Winners don't take all: Characterizing the competition for links on the web
- A critical point for random graphs with a given degree sequence
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Unnamed Item
- Unnamed Item
