Degree distributions in networks: beyond the power law

Abstract

The power law is useful in describing count phenomena such as network degrees and word frequencies. With a single parameter, it captures the main feature that the frequencies are linear on the log-log scale. Nevertheless, there have been criticisms of the power law, for example that a threshold needs to be pre-selected without its uncertainty quantified, that the power law is simply inadequate, and that subsequent hypothesis tests are required to determine whether the data could have come from the power law. We propose a modelling framework that combines two different generalisations of the power law, namely the generalised Pareto distribution and the Zipf-polylog distribution, to resolve these issues. The proposed mixture distributions are shown to fit the data well and quantify the threshold uncertainty in a natural way. A model selection step embedded in the Bayesian inference algorithm further answers the question whether the power law is adequate.

41 pages, 8 figures

References in corpus (13)

• Emergence of scaling in random networks
• Power-law distributions in empirical data
• Power laws, Pareto distributions and Zipf's law
• The diameter of the world wide web
• Spike and slab variable selection: Frequentist and Bayesian strategies
• Scale-free Networks Well Done
• Regression for citation data: An evaluation of different methods
• Science through Wikipedia: A novel representation of open knowledge through co-citation networks
• A Preferential Attachment Paradox: How Preferential Attachment Combines with Growth to Produce Networks with Log-normal In-degree Distributions
• Twitter event networks and the Superstar model
• An approach to describing and analysing bulk biological annotation quality: a case study using UniProtKB
• The nature and origin of heavy tails in retweet activity
• Random Processes with High Variance Produce Scale Free Networks