Skip to main content

Power Law

  • Chapter
  • First Online:
Practical Social Network Analysis with Python

Part of the book series: Computer Communications and Networks ((CCN))

  • 3978 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aiello, William, Fan Chung, and Linyuan Lu. 2002. Random evolution in massive graphs. In Handbook of massive data sets, 97–122. Berlin: Springer.

    Google Scholar 

  2. Barabási, Albert-László, and Réka Albert. 1999. Emergence of scaling in random networks. Science 286 (5439): 509–512.

    Article  MathSciNet  Google Scholar 

  3. 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.

    Google Scholar 

  4. Brookes, Bertram C. 1969. Bradford’s law and the bibliography of science. Nature 224 (5223): 953.

    Article  Google Scholar 

  5. Clauset, Aaron, Cosma Rohilla Shalizi, and Mark E.J. Newman. 2009. Power-law distributions in empirical data. SIAM Review 51 (4): 661–703.

    Google Scholar 

  6. Fractals, Chaos. 1991. Power laws: Minutes from an infinite paradise.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. Grünwald, Peter D. 2007. The minimum description length principle. Cambridge: MIT press.

    Google Scholar 

  9. Kass, Robert E., and Adrian E. Raftery. 1995. Bayes factors. Journal of the American Statistical Association 90 (430): 773–795.

    Google Scholar 

  10. Kleinberg, Jon. 2003. Bursty and hierarchical structure in streams. Data Mining and Knowledge Discovery 7 (4): 373–397.

    Article  MathSciNet  Google Scholar 

  11. Kumar, Ravi, Jasmine Novak, Prabhakar Raghavan, and Andrew Tomkins. 2005. On the bursty evolution of blogspace. World Wide Web 8 (2): 159–178.

    Article  Google Scholar 

  12. Lattanzi, Silvio, and D. Sivakumar. 2009. Affiliation networks. In Proceedings of the forty-first annual ACM symposium on Theory of computing, 427–434. ACM.

    Google Scholar 

  13. 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.

    Article  Google Scholar 

  14. 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.

    Google Scholar 

  15. Lotka, Alfred J. 1926. The frequency distribution of scientific productivity. Journal of the Washington Academy of Sciences 16 (12): 317–323.

    Google Scholar 

  16. Mandelbrot, Benoit. 1960. The pareto-levy law and the distribution of income. International Economic Review 1 (2): 79–106.

    Article  Google Scholar 

  17. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Krishna Raj P. M. .

Problems

Problems

Given that the probability density function (PDF) of a power-law distribution is given by Eq. 11.13.

$$\begin{aligned} P(X=x) = \frac{\alpha -1}{x_{min}}\left( \frac{x}{x_{min}}\right) ^{-\alpha } \end{aligned}$$
(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

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics