Encyclopedia of Social Network Analysis and Mining

Living Edition
| Editors: Reda Alhajj, Jon Rokne

Networks in the Twenty-First Century

Living reference work entry
DOI: https://doi.org/10.1007/978-1-4614-7163-9_80-1

Synonyms

Glossary

Degree

The degree ki of a network node i is its number of neighbors.

Power

A power is an exponent to which a given quantity is raised, for example, x to the ath power, xa.

Power Law

When the probability of an event is proportional to a power of some attribute of that event (e.g., its size), the probability distribution is said to be described by a power law.

Partition

Division of a set into non-overlapping subsets.

Definition

Networks have a long history in a number of fields ranging from sociology to mathematics. This article describes surge of interest in networks in the early twenty-first century (sometimes called network science), in large part driven by interest from the statistical physics community.

Introduction

The study of networks has a deep history in mathematics, sociology, biology, and computer science reaching back to the 1700. But the twenty-first century is when the study of networks grew into a science in its...

Keywords

Milo Stomp 
This is a preview of subscription content, log in to check access

Notes

Acknowledgments

The author would like to thank Vedran Sekara for insightful comments on the manuscript.

References

  1. Ahn Y, Bagrow J, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466(7307):761–764CrossRefGoogle Scholar
  2. Albert R, Jeong H, Barabási A-L (2000) Error and attack tolerance of complex networks. Nature 406:378CrossRefGoogle Scholar
  3. Bak P, Tang C, Wiesenfeld K (1987) Self-organized criticality: an explanation of 1/f noise. Phys Rev Lett 59(4):381–384. MathSciNet
  4. Barabási A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509. MathSciNet
  5. Brin S, Page L (1998) The anatomy of a large scale hypertextual web search engine. Comput Netw 30:107Google Scholar
  6. Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453:98CrossRefGoogle Scholar
  7. de Solla PD (1976) A general theory of bibliometric and other cumulative advantage processes. J Am Soc Inf Sci 27:292CrossRefGoogle Scholar
  8. Kleinberg J (1999) Authoritative sources in a hyperlinked environment. J ACM 46:604. MATH MathSciNet
  9. Maslov S, Sneppen K (2002) Specificity and stability in topology of protein networks. Science 296:910CrossRefGoogle Scholar
  10. Milgram S (1967) The small world problem. Psychol Today 2:60Google Scholar
  11. Milo R, Shen-Orr SS, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298:824CrossRefGoogle Scholar
  12. Newman MEJ (2002) Assortative mixing in networks. Phys Rev Lett 89:208701CrossRefGoogle Scholar
  13. Newman M (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133CrossRefGoogle Scholar
  14. Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113CrossRefGoogle Scholar
  15. Pastor-Satorras R, Vespignani A (2001) Epidemic spreading in scale-free networks. Phys Rev Lett 86(14):3200–3203CrossRefGoogle Scholar
  16. Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási A-L (2002) Hierarchical organization of modularity in metabolic networks. Science 297:1551–1555CrossRefGoogle Scholar
  17. Simon HA (1955) On a class of skew distribution functions. Biometrika 42:425. MATH MathSciNet
  18. Watts DJ (1999) Small worlds. Princeton University Press, PrincetonGoogle Scholar
  19. Watts DJ, Strogatz SH (1998) Collective dynamics of “small-world” networks. Nature 393:440CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media LLC 2016

Authors and Affiliations

  1. 1.DTU Compute, Technical University of DenmarkKgs. LyngbyDenmark