• We are sorry, but NCBI web applications do not support your browser and may not function properly. More information
Logo of pnasPNASInfo for AuthorsSubscriptionsAboutThis Article
Proc Natl Acad Sci U S A. Oct 10, 2000; 97(21): 11149–11152.
Published online Sep 26, 2000.
PMCID: PMC17168
Applied Physical Sciences

Classes of small-world networks

Abstract

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.

Disordered networks, such as small-world networks are the focus of recent interest because of their potential as models for the interaction networks of complex systems (17). Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study “real-world” complex systems (8) such as chemical-reaction networks (9), neuronal networks (2), food webs (1012), social networks (13, 14), scientific-collaboration networks (15), and computer networks (4, 1619).

Small-world networks (2), which emerge as the result of randomly replacing a fraction P of the links of a d dimensional lattice with new random links, interpolate between the two limiting cases of a regular lattice (P = 0) and a random graph (P = 1). A small-world network is characterized by the following properties: (i) the local neighborhood is preserved (as for regular lattices; ref. 2); and (ii) the diameter of the network, quantified by average shortest distance between two vertices (20), increases logarithmically with the number of vertices n (as for random graphs; ref. 21). The latter property gives the name small-world to these networks, because it is possible to connect any two vertices in the network through just a few links, and the local connectivity would suggest the network to be of finite dimensionality.

The structure of small-world networks and of real networks has been probed through the calculation of their diameter as a function of network size (2). In particular, networks such as (a) the electric power grid for Southern California, (b) the network of movie-actor collaborations, and (c) the neuronal network of the worm Caenorhabditis elegans seem to be small-world networks (2). Further, it was proposed (5) that these three networks (a–c) as well as the world-wide web (4) and the network of citations of scientific papers (22, 23) are scale-free—that is, they have a distribution of connectivities that decays with a power law tail.

Scale-free networks emerge in the context of a growing network in which new vertices connect preferentially to the more highly connected vertices in the network (5). Scale-free networks are also small-world networks, because (i) they have clustering coefficients much larger than random networks (2) and (ii) their diameter increases logarithmically with the number of vertices n (5).

Herein, we address the question of the conditions under which disordered networks are scale-free through the analysis of several networks in social, economic, technological, biological, and physical systems. We identify a number of systems for which there is a single scale for the connectivity of the vertices. For all these networks, there are constraints limiting the addition of new links. Our results suggest that such constraints may be the controlling factor for the emergence of scale-free networks.

Empirical Results

First, we consider two examples of technological and economic networks: (i) the electric power grid of Southern California (2), the vertices being generators, transformers, and substations and the links being high-voltage transmission lines; and (ii) the network of world airports (24), the vertices being the airports and the links being nonstop connections. For the case of the airport network, we have access to data on number of passengers in transit and of cargo leaving or arriving at the airport, instead of data on the number of distinct connections. Working under some reasonable assumptions, one can expect that the number of distinct connections from a major airports is proportional to the number of passengers in transit through that airport, making the two examples, i and ii, comparable. Fig. Fig.11 shows the connectivity distribution for these two examples. It is visually apparent that neither case has a power law regime and that both have exponentially decaying tails, implying that there is a single scale for the connectivity k.

Figure 1
Technological and economic networks. (a) Linear-log plot of the cumulative distribution of connectivities for the electric power grid of Southern California (2). For this type of plot, the distribution falls on a straight line, indicating an exponential ...

Second, we consider three examples of “social” networks: (iii) the movie-actor network (2), the links in this network indicating that the two actors were cast at least once in the same movie; (iv) the acquaintance network of Mormons (25), the vertices being 43 Utah Mormons and the number of links the number of other Mormons they know; and (v) the friendship network of 417 Madison Junior High School students (26). These three examples describe apparently distinct types of social networks with very different sample sizes. In fact it can be argued that the network of movie-actor collaborations is not really a social network but is instead an economic network. However, because it was considered in other publications (1, 2, 5) as a social network, we classify it similarly here. We feel that the acquaintance and friendship networks may be better proxies of real social networks and, as such, expect similar results from the analysis of both networks. Fig. Fig.22 shows the connectivity distribution for these social networks. The scale-free (power law) behavior of the movie-actor network (5) is truncated by an exponential tail. In contrast, the network of acquaintances of the Utah Mormons and the friendship network of the high school students display no power law regime, but instead we find results consistent with a Gaussian distribution of connectivities, indicating the existence of a single scale for k.§

Figure 2
Social networks. (a) Linear-log plot of the cumulative distribution of connectivities for the network of movie actors (2). The full line is a guide for the eye of what an exponential decay would be. The data seem to fall faster in the tail than they ...

Third, we consider two examples of networks from the natural sciences: (vi) the neuronal network of the worm C. elegans (2, 27, 28), the vertices being the individual neurons and the links being connections between neurons; and (vii) the conformation space of a lattice polymer chain (29), the vertices being the possible conformations of the polymer chain and the links being the possibility of connecting two conformations through local movements of the chain (29). The conformation space of a linear polymer chain seems to be well described (29) by the small-world networks of ref. 2. Fig. Fig.33 a and b shows for C. elegans the cumulative distribution of k for both incoming and outgoing neuronal links. The tails of both distributions are well approximated by exponential decays, consistent with a single scale for the connectivities. For the network of conformations of a polymer chain, the connectivity follows a binomial distribution, which converges to the Gaussian (29); thus, we also find a single scale for the connectivity of the vertices (Fig. (Fig.33c).

Figure 3
Biological and physical networks. (a) Linear-log plot of the cumulative distribution of outgoing (i.e., connections by axons to other cells) and incoming (i.e., connections by axons from other cells) connections for the neuronal network of the worm ...

Discussion

Thus far, we presented empirical evidence for the occurrence of three structural classes of small-world networks: (a) scale-free networks, characterized by a connectivity distribution with a tail that decays as a power law (4, 22, 23); (b) broad-scale or truncated scale-free networks, characterized by a connectivity distribution that has a power law regime followed by a sharp cutoff, like an exponential or Gaussian decay of the tail (see example iii); and (c) single-scale networks, characterized by a connectivity distribution with a fast decaying tail, such as exponential or Gaussian (see examples i, ii, and iv–vii).

A natural question is “what are the reasons for such a rich range of possible structures for small-world networks?” To answer this question, let us recall that preferential attachment in growing networks gives rise to a power law distribution of connectivities (5). However, preferential attachment can be hindered by two classes of factors.

Aging of the vertices.

This effect can be pictured for the network of actors; in time, every actor will stop acting. For the network, this fact implies that even a very highly connected vertex will, eventually, stop receiving new links. The vertex is still part of the network and contributes to network statistics, but it no longer receives links. The aging of the vertices thus limits the preferential attachment preventing a scale-free distribution of connectivities.

Cost of adding links to the vertices or the limited capacity of a vertex.

This effect is exemplified by the network of world airports: for reasons of efficiency, commercial airlines prefer to have a small number of hubs where all routes connect. In fact, this situation is, to a first approximation, indeed what happens for individual airlines; however, when we consider all airlines together, it becomes physically impossible for an airport to become a hub to all airlines. Because of space and time constraints, each airport will limit the number of landings/departures per hour and the number of passengers in transit. Hence, physical costs of adding links and limited capacity of a vertex (30, 31) will limit the number of possible links attaching to a given vertex.

Modeling.

To test numerically the effect of aging and cost constraints on the local structure of networks with preferential attachment, we simulate the scale-free model of ref. 5 but introduce aging and cost constraints of varying strength. In the original scale-free model, a network grows over time by the addition of new vertices and links. A vertex newly added to the network randomly selects m other vertices to establish new links, with a selection probability that increases with the number of links of the selected vertex. This mechanism generates faster growth of the most connected vertices—in a process identical to the city growth model of Simon and Bonini (32)—and it is well-known that the mechanism leads to a steady state with a power law distribution of connectivities (33).

We generalize this model by classifying vertices into one of two groups: active or inactive. Inactive vertices cannot receive new links. All new vertices are created active but in time may become inactive. We consider two types of constraints that are responsible for the transition from active to inactive. In the first, which we call “aging,” vertices may become inactive each time step with a constant probability Pi. This fact implies that the time a vertex may remain active decays exponentially. In the second, which we call “cost,” a vertex becomes inactive when it reaches a maximum number of links kmax. Fig. Fig.44 shows our results for both types of constraint. It is clear that both lead to cutoffs on the power law decay of the tail of connectivity distribution and that, for strong enough constraints, no power law region is visible.

Figure 4
Truncation of scale-free connectivity by adding constraints to the model of ref. 5. (a) Effect of aging of vertices on the connectivity distribution. We see that aging leads to a cutoff of the power law regime in the connectivity distribution. For ...

Analogy with Critical Phenomena.

We note that the possible distributions of connectivity of the small-world networks have an analogy in the theory of critical phenomena (34). At the gas-liquid critical point, the distribution of sizes of the droplets of the gas (or of the liquid) is scale-free, as there is no free-energy cost in their formation (34). As for the case of a scale-free network, the size s of a droplet is power law distributed: P(s) ≈ sα. As we move away from the critical point, the appearance of a non-negligible surface tension introduces a free-energy cost for droplets that limits their sizes such that their distribution becomes broad-scale: P(s) ≈ sαf(s/ξ), where ξ is the typical size for which surface tension starts to be significant, and the function f(s/ξ) introduces a sharp cutoff for droplet sizes s > ξ. Far from the critical point, the scale ξ becomes so small that no power law regime is observed and the droplets become single-scale distributed: P(s) ≈ f(s/ξ). Often, the distribution of sizes in this regime is exponential or Gaussian.

Acknowledgments

We thank J. S. Andrade, Jr., R. Cuerno, N. Dokholyan, P. Gopikrishnan, C. Hartley, E. LaNave, K. B. Lauritsen, F. Liljeros, H. Orland, F. Starr, and S. Zapperi for stimulating discussions and helpful suggestions. The Center for Polymer Studies is funded by the National Science Foundation and National Institutes of Health (NCRR P41 RP13622).

Footnotes

To be able to compare the two types of distributions, one must make two assumptions. The first assumption is that there is a typical number of passengers per flight. This assumption is reasonable, because the number of seats in airplanes does not follow a power law distribution. The second assumption is that there is a typical number of flights per day between two cities. This assumption is also reasonable, because at most there will be about 20 flights per day and per airline between any two cities; thus, the distribution of number of flights per day between two cities is bounded.

Article published online before print: Proc. Natl. Acad. Sci. USA, 10.1073/pnas.200327197.

Article and publication date are at www.pnas.org/cgi/doi/10.1073/pnas.200327197

§Note that even though the sample sizes of these two networks is rather small, the agreement with the Gaussian distribution is very good, suggesting that our results are reliable. Moreover, a power law distribution would curve the opposite way in the semilog plot.

References

1. Watts D J, Strogatz D H. Nature (London) 1998;393:440–442. [PubMed]
2. Watts D J. Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton, NJ: Princeton Univ. Press; 1999.
3. Barthélémy M, Amaral L A N. Phys Rev Lett. 1999;82:3180–3183.
4. Albert R, Jeong H, Barabási A-L. Nature (London) 1999;401:130.
5. Barabási A-L, Albert R. Science. 1999;286:509–512. [PubMed]
6. Lago-Fernandez L F, Huerta R, Corbacho F, Siguenza J A. Phys Rev Lett. 2000;84:2758–2761. [PubMed]
7. Newman, M. E. J. (2000) J. Stat. Phys., in press.
8. Kochen M, editor. The Small World. Norwood, NJ: Ablex; 1989.
9. Alon U, Surette M G, Barkai N, Leibler S. Nature (London) 1999;397:168–171. [PubMed]
10. Pimm S L, Lawton J H, Cohen J E. Nature (London) 1991;350:669–674.
11. Paine R T. Nature (London) 1992;355:73–75.
12. McCann K, Hastings A, Huxel G R. Nature (London) 1998;395:794–798.
13. Wasserman S, Faust K. Social Network Analysis. Cambridge, U.K.: Cambridge Univ. Press; 1994.
14. Axtell R. In: Behavioral Dimensions of Retirement Economics. Aaron H J, editor. Washington, DC: Brookings Instit.; 1999. pp. 161–183.
15. Van Raan A F J. Nature (London) 1990;347:626.
16. Adamic L A. The Small World Web Res Adv Tech Digit Libr Proc. 1999;1696:443–452.
17. Huberman B A, Pirolli P L T, Pitkow J E, Lukose R J. Science. 1999;280:95–97. [PubMed]
18. Huberman B A, Adamic L A. Nature (London) 1999;401:131. [PubMed]
19. Adamic L A, Huberman B A, Barabási A-L, Albert R, Jeong H, Bianconi G. Science. 2000;287:2115.
20. van Leeuwen J, editor. Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity. Amsterdam: Elsevier; 1999.
21. Bollobás B. Random Graphs. London: Academic; 1985.
22. Seglen P O. J Am Soc Inf Sci. 1992;43:628–638.
23. Redner S. Eur Phys J. 1998;4:131–134.
24. Airport Council International. ACI Annual Worldwide Airports Traffic Reports. Geneva: Airport Counc. Int.; 1999.
25. Bernard H R, Kilworth P D, Evans M J, McCarty C, Selley G A. Ethnology. 1988;27:155–179.
26. Fararo T J, Sunshine M H. A Study of a Biased Friendship Net. Syracuse, NY: Syracuse Univ. Press; 1964.
27. White J G, Southgate E, Thomson J N, Brenner S. Philos Trans R Soc London B. 1986;314:1–340. [PubMed]
28. Koch C, Laurent G. Science. 1999;284:96–98. [PubMed]
29. Scala A, Amaral L A N, Barthélémy M. Small-World Networks and the Conformation Space of a Lattice Polymer Chain. cond-mat/0004380; 1999.
30. Bonney M E. In: Sociometry and the Science of Man. Moreno J L, editor. New York: Beacon House; 1956. pp. 275–286.
31. Moreno J L. Sociometry and the Science of Man. New York: Beacon House; 1956.
32. Simon H A, Bonini C P. Am Econ Rev. 1958;48:607–617.
33. Ijiri Y, Simon H A. Skew Distributions and the Sizes of Business Firms. Amsterdam: North–Holland; 1977.
34. Stanley H E. Introduction to Phase Transitions and Critical Phenomena. Oxford: Oxford Univ. Press; 1971.

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

Formats:

Related citations in PubMed

See reviews...See all...

Cited by other articles in PMC

See all...

Links

Recent Activity

  • Classes of small-world networks
    Classes of small-world networks
    Proceedings of the National Academy of Sciences of the United States of America. Oct 10, 2000; 97(21)11149
    PMC

Your browsing activity is empty.

Activity recording is turned off.

Turn recording back on

See more...