Abstract
A quantity x is said to obey a power law is it is drawn from a probability distribution given by \(p(x) \propto x^{-\alpha }\) where \(\alpha \) is a constant parameter known as exponent. In this chapter we will look at ways to determine whether or not a certain set of values follow a power law. We will learn graph models that can exhibit power-law, mainly focusing on the preferential attachment model that has power-law degree distribution. We will then look at the rich-get-richer phenomenon and how this is prevalent in citation networks and population growth of cities. Finally, we will cover densification power laws and shrinking diameters which are properties observed from temporal social networks, which have given rise to the forest fire model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aiello, William, Fan Chung, and Linyuan Lu. 2002. Random evolution in massive graphs. In Handbook of massive data sets, 97–122. Berlin: Springer.
Barabási, Albert-László, and Réka Albert. 1999. Emergence of scaling in random networks. Science 286 (5439): 509–512.
Bollobás, Béla, Christian Borgs, Jennifer Chayes, and Oliver Riordan. 2003. Directed scale-free graphs. In Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, 132–139. Society for Industrial and Applied Mathematics.
Brookes, Bertram C. 1969. Bradford’s law and the bibliography of science. Nature 224 (5223): 953.
Clauset, Aaron, Cosma Rohilla Shalizi, and Mark E.J. Newman. 2009. Power-law distributions in empirical data. SIAM Review 51 (4): 661–703.
Fractals, Chaos. 1991. Power laws: Minutes from an infinite paradise.
Goel, Sharad, Andrei Broder, Evgeniy Gabrilovich, and Bo Pang. 2010. Anatomy of the long tail: Ordinary people with extraordinary tastes. In Proceedings of the third ACM international conference on Web search and data mining, 201–210. ACM.
Grünwald, Peter D. 2007. The minimum description length principle. Cambridge: MIT press.
Kass, Robert E., and Adrian E. Raftery. 1995. Bayes factors. Journal of the American Statistical Association 90 (430): 773–795.
Kleinberg, Jon. 2003. Bursty and hierarchical structure in streams. Data Mining and Knowledge Discovery 7 (4): 373–397.
Kumar, Ravi, Jasmine Novak, Prabhakar Raghavan, and Andrew Tomkins. 2005. On the bursty evolution of blogspace. World Wide Web 8 (2): 159–178.
Lattanzi, Silvio, and D. Sivakumar. 2009. Affiliation networks. In Proceedings of the forty-first annual ACM symposium on Theory of computing, 427–434. ACM.
Leskovec, Jure, Jon Kleinberg, and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1 (1): 2.
Leskovec, Jure, Lars Backstrom, Ravi Kumar, and Andrew Tomkins. 2008. Microscopic evolution of social networks. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, 462–470. ACM.
Lotka, Alfred J. 1926. The frequency distribution of scientific productivity. Journal of the Washington Academy of Sciences 16 (12): 317–323.
Mandelbrot, Benoit. 1960. The pareto-levy law and the distribution of income. International Economic Review 1 (2): 79–106.
Stone, Mervyn. 1977. An asymptotic equivalence of choice of model by cross-validation and Akaike’s criterion. Journal of the Royal Statistical Society. Series B (Methodological) 39: 44–47.
Author information
Authors and Affiliations
Corresponding author
Problems
Problems
Given that the probability density function (PDF) of a power-law distribution is given by Eq. 11.13.
where \(x_{min}\) is the minimum value that X can take.
60
Derive an expression of \(P(X\ge x)\), the Complementary Cumulative Distribution Function (CCDF), in terms of \(\alpha \).
61
Show how to generate a random sample from the power-law distribution using the CCDF derived and a uniform random sample \(u \sim U(0,1)\).
62
Using this sampling technique, create a dataset of 10000 samples following the power-law distribution with exponent \(\alpha =2\) and \(x_{min}=1\). Plot the empirical distribution on a log-log scale by first rounding each sample to the nearest integer and then plotting the empirical PDF over these rounded values. Also plot the true probability density function for the power law (this will help verify that the data was generated correctly).
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Raj P. M., K., Mohan, A., Srinivasa, K.G. (2018). Power Law . In: Practical Social Network Analysis with Python. Computer Communications and Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-96746-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-96746-2_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96745-5
Online ISBN: 978-3-319-96746-2
eBook Packages: Computer ScienceComputer Science (R0)