Classes of small-world networks.

By L. A. Amaral, Antonio Scala, Marc Barthelemy, H. Eugene Stanley. Proceedings of the National Academy of Sciences of the United States of America, 2000

3,090 citations recorded by the source corpus.

We study the statistical properties of a variety of diverse real-world networks. We present evidence of the occurrence of three classes of small-world networks: (a) scale-free networks, characterized by a vertex connectivity distribution that decays as a power law; (b) broad-scale networks, characterized by a connectivity distribution that has a power law regime followed by a sharp cutoff; and (c) single-scale networks, characterized by a connectivity distribution with a fast decaying tail. Moreover, we note for the classes of broad-scale and single-scale networks that there are constraints limiting the addition of new links. Our results suggest that the nature of such constraints may be the controlling factor for the emergence of different classes of networks.

Subfields: Experimental and Cognitive Psychology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/61be22241a09b72c0a1a6d928f2c08aa839ec3f7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Experimental and Cognitive Psychology

  1. E. Bullmore
  2. Yong He
  3. Olaf Sporns
  4. Mark Newman
  5. Alex Fornito
  6. Jinhui Wang
  7. Andrew Zalesky
  8. Alan C. Evans

In Statistical and Nonlinear Physics

  1. Mark Newman
  2. Santo Fortunato
  3. Olaf Sporns
  4. Jure Leskovec
  5. Alex Arenas
  6. Renaud Lambiotte
  7. Marc Barthelemy
  8. Albert-László Barabási

Citations in the corpus