plfit
plfit: Fitting power-law distributions to empirical data. This program fits power-law distributions to empirical (discrete or continuous) data, according to the method of Clauset, Shalizi and Newman. Power-law distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and man-made phenomena. Unfortunately, the detection and characterization of power laws is complicated by the large fluctuations that occur in the tail of the distributions – the part of the distributions representing large but rare events – and by the difficulty of identifying the range over which power-law behavior holds. Commonly used methods for analyzing power-law data, such as least-squares fitting, can produce substantially inaccurate estimates of parameters for power-law distributions, and even in cases where such methods return accurate answers they are still unsatisfactory because they give no indication of whether the data obey a power law at all. We present a principled statistical framework for discerning and quantifying power-law behavior in empirical data. Our approach combines maximum-likelihood fitting methods with goodness-of-fit tests based on the Kolmogorov - Smirnov (KS) statistic and likelihood ratios. We evaluate the effectiveness of the approach with tests on synthetic data and give critical comparisons to previous approaches. We also apply the proposed methods to twenty-four real-world data sets from a range of different disciplines, each of which has been conjectured to follow a power-law distribution. In some cases we find these conjectures to be consistent with the data, while in others the power law is ruled out.
Keywords for this software
References in zbMATH (referenced in 205 articles , 1 standard article )
Showing results 1 to 20 of 205.
Sorted by year (- Ardekani, Aref Mahdavi; Distinguin, Isabelle; Tarazi, Amine: Do banks change their liquidity ratios based on network characteristics? (2020)
- Bandyopadhyay, Abhirup; Dhar, Amit Kumar; Basu, Sankar: Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (2020)
- Clote, P.: Are RNA networks scale-free? (2020)
- Duarte-López, Ariel; Pérez-Casany, Marta; Valero, Jordi: The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks (2020)
- Grilli, Ruggero; Tedeschi, Gabriele; Gallegati, Mauro: Business fluctuations in a behavioral switching model: gridlock effects and credit crunch phenomena in financial networks (2020)
- Halvarsson, Daniel: Maximum likelihood estimation of asymmetric double type II Pareto distributions (2020)
- Lehtomaa, Jaakko; Resnick, Sidney I.: Asymptotic independence and support detection techniques for heavy-tailed multivariate data (2020)
- Pachon, Angelica; Polito, Federico; Sacerdote, Laura: On the continuous-time limit of the Barabási-Albert random graph (2020)
- Seres, István András; Gulyás, László; Nagy, Dániel A.; Burcsi, Péter: Topological analysis of Bitcoin’s lightning network (2020)
- Song, Yangbo; van der Schaar, Mihaela: Dynamic network formation with foresighted agents (2020)
- Wang, Tiandong; Resnick, Sidney I.: Degree growth rates and index estimation in a directed preferential attachment model (2020)
- Wan, Phyllis; Wang, Tiandong; Davis, Richard A.; Resnick, Sidney I.: Are extreme value estimation methods useful for network data? (2020)
- Zhu, Xuening; Huang, Danyang; Pan, Rui; Wang, Hansheng: Multivariate spatial autoregressive model for large scale social networks (2020)
- Borgs, Christian; Chayes, Jennifer T.; Cohn, Henry; Zhao, Yufei: An (L^p) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions (2019)
- Bricker, Jesse; Hansen, Peter; Volz, Alice Henriques: Wealth concentration in the U.S. after augmenting the upper tail of the survey of consumer finances (2019)
- Demaine, Erik D.; Reidl, Felix; Rossmanith, Peter; F. S. Sánchez Villaamil, Fernando; Sikdar, Somnath; Sullivan, Blair D.: Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (2019)
- Eden, Talya; Ron, Dana; Seshadhri, C.: Sublinear time estimation of degree distribution moments: the arboricity connection (2019)
- Ehrhardt, Beate; Wolfe, Patrick J.: Network modularity in the presence of covariates (2019)
- Hou, Wenpin; Ruan, Peiying; Ching, Wai-Ki; Akutsu, Tatsuya: On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors (2019)
- James, Richard D.: Materials from mathematics (2019)