Many technological, biological, social, and information networks fall into the broad class of ‘small-world’ networks: they have tightly interconnected clusters of nodes, and a shortest mean path length that is similar to a matched random graph (same number of nodes and edges). This semi-quantitative definition leads to a categorical distinction (‘small/not-small’) rather than a quantitative, continuous grading of networks, and can lead to uncertainty about a network's small-world status. Moreover, systems described by small-world networks are often studied using an equivalent canonical network model – the Watts-Strogatz (WS) model. However, the process of establishing an equivalent WS model is imprecise and there is a pressing need to discover ways in which this equivalence may be quantified.
We defined a precise measure of ‘small-world-ness’ S based on the trade off between high local clustering and short path length. A network is now deemed a ‘small-world’ if S>1 - an assertion which may be tested statistically. We then examined the behavior of S on a large data-set of real-world systems. We found that all these systems were linked by a linear relationship between their S values and the network size n. Moreover, we show a method for assigning a unique Watts-Strogatz (WS) model to any real-world network, and show analytically that the WS models associated with our sample of networks also show linearity between S and n. Linearity between S and n is not, however, inevitable, and neither is S maximal for an arbitrary network of given size. Linearity may, however, be explained by a common limiting growth process.
Citation: Humphries MD, Gurney K (2008) Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence. PLoS ONE 3(4): e0002051. https://doi.org/10.1371/journal.pone.0002051
Editor: Olaf Sporns, Indiana University, United States of America
Received: November 21, 2007; Accepted: March 16, 2008; Published: April 30, 2008
Copyright: © 2008 Humphries, Gurney. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: MDH acknowledges support by the EU Framework 6 IST-027819-IP (ICEA) project. KG acknowledges the support of EPSRC grant EP/C516303/1. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
Networks are widely used to both represent real-world systems for topological study  and as a substrate for modeling their dynamics . Many real technological, biological, social, and information networks fall into the broad class of ‘small-world’ networks , a middle ground between regular and random networks: they have high local clustering of elements, like regular networks, but also short path lengths between elements, like random networks. Membership of the ‘small-world’ network class also implies that the corresponding systems have dynamic properties different from those of equivalent random or regular networks –.
One popular method for studying small-world networks is to use an equivalent network model to generate other similar instances of the class of systems under study. Such generating models may also possess analytic properties that, we assume, may be extrapolated to the target system. One canonical model used as a candidate for network equivalence is the original Watts-Strogatz (WS) model, which has been used as a substrate for studying dynamics in the diverse fields of ecology , economics , , epidemiology , , and neuroscience .
However, the existing ‘small-world’ definition is a categorical one, and breaks the continuum of network topologies into the three classes of regular, random, and small-world networks, with the latter being the broadest. It is unclear to what extent the real-world systems in the small-world class have common network properties and to what specific point in the “middle-ground” (between random and regular) a network generating model must be tuned to genuinely capture the topology of such systems. Here we explore a continuous, quantitative, measure of ‘small-world-ness’, with the aim of overcoming these inadequacies in the current theory of small-world networks.
When describing a real-world system as a network, each element of the system is represented by a vertex or node, and relationships or interactions between elements are represented by edges between nodes. Two nodes are said to be neighbors if they are connected by an edge, and the degree ki of node i is the number of neighbors it has. The minimum path length between two nodes is the minimum number of edges that must be traversed to get from one node to the other. The mean value of the minimum path length over all node pairs will be denoted by L.
A key concept in defining small-worlds networks is that of ‘clustering’ which measures the extent to which the neighbors of a node are also interconnected. Watts and Strogatz  defined the clustering coefficient of node i by(1)where Ei is the number of edges between the neighbors of i. The clustering coefficient of the network Cws is then the mean of over all nodes. An alternative definition of network clustering in common use , based on transitivity, is expressed by(2)where a ‘triangle’ is a set of three nodes in which each contacts the other two. Both capture intuitive notions of clustering but, though often in good agreement, values for Cws and CΔ can differ by an order of magnitude for some networks. We consider mainly CΔ here, but report where using Cws leads to different results.
A network G with n nodes and m edges is a small-world network  if it has a similar path length but greater clustering of nodes than an equivalent Erdös-Rényi (E–R) random graph  with the same m and n (an E–R graph is constructed by uniquely assigning each edge to a node pair with uniform probability). More formally, let Lg be the mean shortest path length of G and its clustering coefficient using (2). Let Lrand and be the corresponding quantities for the corresponding E–R random graph. These ideas may be used to supply a semi-quantitative categorical definition of a small world network 
New measures of small-world-ness
Put(3)and(4)We then define a quantitative metric of ‘small-world-ness’ SΔ according to(5)In a similar way, putting(6)we define Sws(7)The categorical definition of small-world network above implies λg≥1 and , which, in turn, gives SΔ>1. We can, therefore, now make a quantitative categorical definition of a ‘small-world’ network
A network is said to be a small-world network if SΔ>1
A similar definition may also be given with respect to Sws.
However, notwithstanding the new categorical definition, we wish to emphasize here the utility of using a continuously graded notion of small-world-ness. We go on, therefore, to analyze the properties of the new metrics, and apply them to real-world data for the first time (in  we originally proposed this metric as a tool for comparing theoretical neuroanatomy models; its subsequent adoption by others , ,  motivated us to consider its theoretical and empirical applications as a universal metric).
New metrics behave as required with the Watts-Strogatz model
We first checked that the metric SΔ behaves as required on the canonical Watts-Strogatz (WS) model of small-world generation . The WS model begins with a ring of n nodes, each node connected to its nearest neighbors out to some range K. Each edge in turn is ‘re-wired’ to a new target node with probability p (Figure 1A). Values of p = 0 and p = 1 give regular and random networks, respectively, with intermediate p values resulting in ‘small-world’ networks that share properties of both provided that the network is connected and sparse — densely connected networks trivially have small mean path lengths and high clustering coefficients.
A The WS model begins with a ring of n nodes, each node connected to its nearest neighbors out to some range K (here K = 3). Each edge in turn is re-wired to a new target node with probability p. B The WS model shows that p = 0 gives a regular network, with high clustering but high path length; p = 1 gives a pseudo-random network, with low clustering and path length; and intermediate p values give small-world networks with high clustering and low path lengths. The S metric tracks these changes precisely, and shows which unique p value corresponds to high clustering and low path length. Normalized L (▿); normalized C (○); normalized S (•). C The small-world property only applies to sparse networks: densely connected networks trivially have high clustering and short path lengths. With increasing edge density ξ on the WS model, the S metric indicates the absence of meaningful small-world structure. A particular edge density for the WS model is obtained by setting K = [ξ(n−1)/2]. All numerical results obtained on graphs with n = 1000, each data-point an average over 20 realizations for each p (with K = 10) or ξ (with p = 0.1) value.
Figure 1 shows that small-world-ness captures the topology changes: it has a unique maximum at intermediate values of the re-wiring parameter p, indicating the maximum trade-off between high clustering and low path length (Figure 1B), and decays with increasing edge density for a fixed size of network, reflecting the requirement of sparseness (Figure 1C). We can see why this occurs for increasing density. The edge density of a network is given by(8)
As ξ→1 then both Cws, CΔ→1 and L→1 because all nodes become connected; and as this would apply for both a given real-world network and its E-R random graph equivalent, so SΔ, Sws→1 regardless of n: high edge density results in low small-world-ness.
Small-world-ness scales linearly with n for real networks
We computed SΔ and Sws for a broad range of technological, biological, social, and information networks (33 networks in total; Table 1, see Materials and Methods). To our surprise, we found that both forms of small-world-ness scale linearly with the size of the network across all systems falling into the small-world class (Figure 2A,B), irrespective of their originating domain or their other topological properties (e.g. their degree distribution, degree correlation). For SΔ, it was not possible to find or calculate CΔ (and hence SΔ) for 6 of the 33 networks. However, for the remaining 27, all had SΔ>1 and were therefore deemed to be small-world in the new scheme (Definition 2). To ensure the robustness of the categorization, networks with borderline values 1≤SΔ≤3 were tested for significance using Monte Carlo sampling of 1000 equivalent E–R random graphs for each network, estimating 99% confidence intervals using standard methods (see Materials and Methods). All such networks had small-world-ness scores significantly greater than an equivalent E–R random graph. For the 27 networks for which SΔ>1, linear regression on log-transformed quantities (see Materials and Methods) allowed an estimate of the best power law fit: SΔ = 0.023n0.96 (r2 = 0.78; p = 3×10−9). This is an essentially linear scaling of SΔ with n.
A Small-world-ness SΔ scales linearly with network size n across real networks from all domains, and irrespective of their other properties. We show SΔ for all 27 networks for which CΔ could be found or calculated; result was SΔ = 0.023n0.96 (r2 = 0.78; p = 3×10−9). The dashed line is the theoretical maximum small-world-ness value of SΔ = 0.181n (see text), given the implied mean degree of 〈k〉≈5 (see below). B Similarly, using known or calculated Cws, we found Sws = 0.012n1.11 (30 networks with Sws>1; r2 = 0.84; p = 1.3×10−11). C Number of edges m also scales linearly with network size n — CΔ data-set shown. Best-fit model was m = 2.46n1.06 (27 networks, r2 = 0.92, p = 4×10−15), implying a mean node degree of 〈k〉 = 2m/n≈5. For the Cws data-set, we found m = 3.16n1.03 (30 networks, r2 = 0.91, p = 2×10−15) implying 〈k〉≈6.32. Residuals of all regressions on log10-transformed data did not significantly differ from a normal distribution at p = 0.01 (Anderson-Darling test . CΔ data-set, 27 networks: n vs SΔ: A2 = 0.36, p = 0.5; n vs m: A2 = 0.45, p = 0.28. Cws data-set, 30 networks: n vs Sws: A2 = 0.8, p = 0.04; n vs m: A2 = 0.82, p = 0.033). Network domains: social (▿); information (); technological (○); biological (⧫).
For Sws, 3 networks in our data-set were not small-worlds: relationships amongst students  Sws = 0.27 (network #9); a freshwater food web ,  Sws = 0.74 (network #28); and the E-Coli reaction graph  Sws = 0.67 (network #32). This demonstrates both that the small-world property is not robustly achieved for small networks, and that it is contingent on the particular measure of clustering used. Once again, networks with borderline values 1≤Sws≤3 were tested using Monte Carlo methods for significant membership of the small-world category and were found to satisfy this criterion. For the 30 networks with Sws>1, a similar regression to that used for SΔ gave Sws = 0.012n1.11 (r2 = 0.84; p = 1.3×10−11). Thus, there is also a robust linear scaling of Sws with n (see Text S1 for further details).
Linear scaling on the Watts-Strogatz model
Linear scaling of small-world-ness with network size was unexpectedly shown by the canonical Watts-Strogatz model  of small-world network generation. We now show that this result can be explained analytically. In what follows, many of the relationships are held only approximately, but because these approximations are often very good we show them as equalities. Note that from here on we use subscript names to identify analytic quantities that pertain to a particular network model only.
If Lws is the mean shortest path length in the WS model, then it is known  that(9)Similarly, it is known for E-R random graphs  that(10)where 〈k〉 is the expected value of the degree across the network. In the WS model, node degree and range are related by 〈k〉 = 2K, so that(11)Using (11), (9) and (4) the path length ratio λws for the WS model is(12)The function f(x) in (9) has an upper asymptote of ln(2x)/4x if . Thus, assuming , (12) becomes(13)If is the clustering coefficient of the WS model (using (2) as the metric), then it is known  that(14)For E–R random graphs , to a good approximation, , so that using 〈k〉 = 2K(15)Therefore, using, (14), (15) and (3)(16)From (5), (16) and (13),(17)where h(K, p) is a function of K and p only. The term in the square brackets tends to 1 as n→∞ and so, for large enough n, SΔ for the WS model scales with n. To quantify this approximation, we performed a linear regression on log-transformed quantities (just as for the real networks) over the typical range of n encountered in our sample of networks, 102≤n≤107, and found a linear fit, with r2 within 10−5 of unity.
Establishing the precise WS model correlate of a real network
The WS network is often used as a generative model for real small-world networks [e.g. 8]–. This is assumed to establish a ‘first-pass’ model of that system’s topology, which may be augmented by considering other factors such as degree sequence , degree correlation , modularity  and other properties.
In matching the WS parameters K, p, n to the target system, we know n, can measure 〈k〉 (giving K = 〈k〉/2), but estimating p has, hitherto, remained problematic. However, using our new metric of small-world-ness, it is possible to establish p in a principled way. Thus, if G is a real (target) network with measured small-world-ness , we identify it with the WS network with the same value of SΔ. That is, form , where is given by the right hand side of (17), and minimise e with respect to p, keeping K, n at their measured values. We did this for our sample of real-world systems, omitting those for which 〈k〉≤2 since the expressions used in defining are inaccurate in these cases (we used Matlab routine fzero, initial value of p = 0.5). The resulting p values for the equivalent WS model are listed in Table 1
Given that the real-world networks showed SΔ∝n, the WS networks derived from them under the procedure described here must do likewise (they have identical SΔ values). However, the result in the previous section would suggest that this implies K, p are roughly constant for this set of WS networks.
To investigate the constancy of K we used the result that 〈k〉 = 2m/n (where m is the number of edges in the network). So, using K = 〈k〉/2, constant K is equivalent to establishing m∝n. Figure 2C shows the result of regressing m against n (using log-transformed quantities) for the real world networks. For networks with SΔ>1, the best fit model was m = 2.46n1.06 (27 networks, r2 = 0.92, p = 4×10−15), implying a mean node degree of 〈k〉 = 2m/n≈5; for networks with Sws>1, the best fit model was m = 3.16n1.03 (30 networks, r2 = 0.91, p = 2×10−15) implying 〈k〉≈6.32. Thus, the real-world networks fulfill the prediction of constant mean node degree. A similar result holds for p values; we found that all testable real-world systems fall into a very limited range of p for the equivalent WS model (0.64≤p≤0.95 and σp = 0.0806).
An alternative view of these results is as follows. We could start with the empirically observed approximate constancy of mean node degree 〈k〉 and calculated rewiring parameter p for the real world networks, and deduce a linear scaling of SΔ for the WS models. Then, under the equivalence of SΔ for both real-world networks and their WS counterparts, we could have predicted that SΔ for the real-world networks would also scale linearly.
The linear scaling of small-world-ness with n is not inevitable
Is the relationship S∝n inevitable for all systems? (The subsequent argument holds for S based on either definition of clustering coefficient and so superscripts Δ, ws are dropped). To investigate this we note that it is always possible to write Si = αini for the ith system, for some value αi; in the case of linear scaling, αi is constant. To proceed further, we now express αi in terms of other system parameters. Using the definition of S and (10) for random graphs,(18)where Ci, Li, 〈k〉i are the clustering coefficient, mean shortest path length, and mean node degree of system i respectively. While we do not know exactly how Li depends on n, we note that the mean shortest path length for small-world networks is usually assumed to scale logarithmically like random graphs: from (11), Lrand = [1/ln(〈k〉)]ln(n); and for the WS model, using (9) with large n, Lws = (1/4K2p)ln(n). Both relations are of the form L = βln(n) where β is independent of n. We therefore write Li = βiln(ni), where βi is the factor that ensures the equality to be true (i.e it plays a similar role in this respect as αi).
This gives(19)In general, there is no a priori reason to suppose that the variables Ci, 〈k〉i and βi are either all constant, or co-vary in a way commensurate with constancy for αi. However, for the sample of networks used here, as noted above, the mean node degree 〈k〉i is approximately constant. It is now instructive to see how much co-variation is required between the remaining two variables in order to ensure a significantly different power law holds between S and n.
Thus, suppose that we fit a model S = μn1.5 so that we expect . For the range of n encountered here – approximately four orders of magnitude – αi would therefore have to range over 2 orders of magnitude. For this to occur, there must be sufficient variation in Ci and βi, and these two quantities should correlate well with n. The ranges of the two variables are reasonably large in the data-set – using CΔ, 0.209≤βi≤2.52 and 0.005≤Ci≤0.72 – and could plausibly generate the required 100-fold variation. However, the correlation coefficients with n are very small: for βi, r2 = 0.028 and for Ci, r2 = 0.025. This would therefore appear to preclude a nonlinear relationship between SΔ and n for the networks studied here.
To study the effect of a lack of correlation between n and network parameters like Ci on linear scaling between SΔ and n, we ran a Monte Carlo simulation (see Materials and Methods). Each one of 1000 experiments consisted of sampling 27 randomly drawn C values for networks with constant β, and with a spread of n over 4 orders of magnitude. For each network its small-world-ness was computed and a linear regression of S against n performed. This resulted in a mean of r2 = 0.89±0.06 s.d. across the 1000 experiments, showing the strong tendency for linearity in this case.
The linear relationship is, however, sensitive to deviations from the approximation that 〈k〉 is constant. That is, networks that deviate furthest from the linear m∝n model in turn deviate furthest from the linear S∝n model (Figure 3). This was shown using a novel regress-delete-regress procedure outlined in Materials and Methods (we were able to directly test the sensitivity to 〈k〉, rather than using a Monte Carlo approach as above, because the strong correlation of m with n provided a baseline from which we could quantify deviation of 〈k〉 from constancy). Further, Figure 3 shows that if we delete a random set of networks from the data-set, then the average effect is to not change the fit to the linear S∝n model: the linear scaling is robust, and does not depend on a specific network set.
We test the effect of real-world networks deviating from the constant 〈k〉 assumption using the following iterative procedure: (i) regress n vs m for the data-set (as in Figure 2C); (ii) select network to remove from data-set based on regression outcome; (iii) regress n vs S for reduced data-set and record new goodness-of-fit (as r2); (iv) repeat from (i) until 50% of networks removed. We do this for 3 selection cases, based on SΔ here, in step (ii): (a) removing the network with the largest deviation from m∝n linear model increased the goodness-of-fit (○) for the S∝n linear model (the dotted line indicates the original goodness-of-fit value at r2 = 0.78); (b) removing networks with the smallest deviation from m∝n linear model decreased the goodness-of-fit (▿) for the S∝n linear model; (c) random deletion did not consistently change the goodness-of-fit (•). Thus deviation from the assumption of constant 〈k〉 correlates with deviation from the linear S∝n model for the real-world networks, as predicted by the WS model. In addition, case (c) shows that the linear S∝n model is robust to taking random sub-sets of the networks. Identical trends were obtained for Sws. All random deletion data-points averaged over 1000 realizations of the regress-delete-regress sequence; both largest and smallest deviation cases were unique sequences.
The sensitivity of small-world-ness linearity with n to degree 〈k〉 suggests that introduction of networks with very high edge density into our sample would destroy the linear scaling. We can rewrite (8) using 〈k〉 = 2m/n(20)and see that mean degree scales linearly with edge density. Thus, a network with high edge density implies high mean degree, which in turn would fall far from the linear S = αn model, as we have just shown.
One exemplar of a real system with high edge density is the network of individual neurons within a single vertebrate brain region. Detailed network data for these are not available because of the great technical difficulties in reliably reconstructing even small networks such as the 302 neuron C. Elegans nervous system . Indeed, high edge density itself may be the primary cause of technical problems in reconstructing complete systems from many domains, resulting in their absence from the network literature. Nonetheless, approximate reconstructions can be attempted. Quantitative anatomical models of individual brain regions suggest that each of the hundreds of thousands or millions of neurons receive many thousands of connections, and each themselves connect to similar numbers of target neurons , . Such networks of neurons can have very low small-world-ness values for their size , and thus fall far from the linear S∝n model discovered here.
We conclude here that the linear relationship between small-world-ness and system size does not hold for an arbitrary collection of networks, but is highly likely if all such networks have a similar mean node degree.
Other scaling properties of small-world-ness
Having established that S scales linearly with n, it is also instructive to look at how its component ratios scale with n. We find, as expected, that most networks falling into the small-world class have approximately the same mean shortest path length as their equivalent E–R random graphs, and so λ≈1. Given this, it is unsurprising that both γΔ and γws then scale linearly with n (see Figure S1). We did find that three networks in our data-set — email messages (#7), software packages (#21), and software classes (#22) — had λ≈0.1, indicating that their mean shortest path length was an order of magnitude smaller than the equivalent E–R random graph. These networks are thus ultra-small , and indeed both email message (#7) and software package (#21) networks fall further from the linear model than any others.
Given the existence of the linear scaling with n, the scaling of small-world-ness with some other topological properties is completely determined. We can directly determine from (20) how edge density behaves in our data-set (values for ξ are given in Table 1). Taking our fitted linear model S = αn, we can substitute n = S/α in (20) and find that(21)Substituting our found values of 〈k〉 and α for the fits to either Sws or SΔ confirms that this is a good approximation. Therefore, because small-world-ness linearly scales with network size, and degree is approximately constant, then S also has a simple inverse linear scaling with edge density.
Real-world systems do not maximize small-world-ness
We can show that the specific scaling coefficient α in the relationship S = αn for the real-world networks studied here does not maximize small-world-ness for a particular size of network. First, we show that the WS model predicts an approximately constant amount of rewiring p that maximizes SΔ, independent of network size. To do this, given the above analytic expressions (13) for λws and (16) for (and again assuming ), we found , and set . Solving this equality for p would then give us the value of p that maximized , if one existed — see Text S1 for details of the solution.
We did this over the range with K = 〈k〉/2 = 2.5, since this is implied by the result of Figure 2C. If p* is the value of p giving maximal , we found that for small networks (n = 103) p* = 0.222 and, as n→∞, p*→0.246, so that the range of p* is very small. The constant K and very small range of p* imply that the associated maximum values should scale linearly with n. It transpires that the theoretical maximum depends almost exactly in a linear way on n with slope 0.181 (and plotted in Figure 2A). Thus, SΔ is not maximized by the real-world networks.
A generative mechanism for a specific linear S∝n relationship
We have established and explained many simple properties of real-world networks and of their equivalence class in the WS model. We now show how the specific, sub-maximal, linear scaling of S = αn could have been generated. The models we examine here are intended as informative examples of the generation and limits on S scaling, not an exhaustive list of those which could generate the specific linear scaling we found — that remains the subject of future work.
Many of the real-world systems share common generative principals despite their widely differing origins. Most systems have a growth process, showing some form of preferential attachment  that is limited by the cost of adding new edges and by the capacity to maintain them (as might be induced by aging) . Simple models of this process result in ‘scale-free’ networks with power-law or truncated power-law degree distributions , , a property that is also common to many real-world systems considered here  (but see  for an alternative view of some biological networks). However, networks generated by these models are not ‘small-world’ by either Definition 1 or 2. Their clustering coefficient is inversely proportional to n, going to zero as n grows large . Thus, they cannot show linear scaling of S: it is at best constant and at worst goes to zero with increasing n.
A noisy, limited growth process can generate the specific linear S = αn relationships we report. A generalized form of the Klemm-Eguiluz model (GKE),  encapsulates this process, and has the unique property of creating networks that are both small-world (short path length, high clustering) and ‘scale-free’ (having a truncated power-law degree distribution) as found for many real-world systems considered here. (To the best of our knowledge, all known real-world systems with power-law-like degree distributions also fall into the broad ‘small-world’ class we discussed in the Introduction; it is only the scale-free networks formed by the simple models that form a distinct set of ‘scale-free-only’ networks). By using the GKE model, we therefore also show that linear scaling of S can occur whether or not the real-world systems have ‘scale-free’ properties.
The GKE model begins with an active set of M nodes. At every time-step a new node is added, connecting d edges: one edge added to a random inactive node with probability ρ, adding noise to the process; all remaining edges connect to randomly chosen active nodes. One of the active nodes is deactivated with a probability proportional to the active nodes’ degrees; finally, the new node is activated. The sequence repeats until the desired size of network is obtained.
We found that specific values for M and ρ could generate GKE networks with the same linear scaling relationships between network size and Sws and SΔ that we observed for the real-world networks (Figure 4; see Materials and Methods, and Figure S2). Therefore, a possible general mechanism for particular linear scaling rates of small-world-ness is a common size of both active node set and quantity of noise during creation of the real-world systems.
We created 5 networks for every value of using a generalized form of the Klemm-Eguiluz model (GKE) , , setting d = 3 so that the resulting networks had the same mean degree (∼6) as we found for the real-world systems. We searched on the GKE model's M and ρ parameters (see text) to minimize the root mean square error between the resulting scaling of the averaged Sws (•) and SΔ (○) values and the observed real-world network relationships (respectively, the solid and broken lines). The best-fit parameters were different for the two forms of S, underlining that they measure two different properties of the real systems.
Small-world-ness is a topological property linking real-world systems across domains of research. Hitherto it has been defined only in semi-quantitative way (Definition 1). In this paper we propose quantitative measures of small-world-ness – SΔ and Sws – and define a network to be in the small-world category with respect to either of them if the small-world-ness is greater than 1 (e.g Definition 2). This quantification of small-world-ness allows for the statistical testing of its presence in any given network.
The Watts-Strogatz (WS) model plays a key role in the study of small-world networks. It uses a generative process to create classes of small-world network and is now widely used as a model for studying dynamic systems –. However, until now, a precise parameterization of the WS model associated with a given kind of real-world network remained elusive. Our introduction of a quantitative measure of small-world-ness remedies this by demanding that the WS counterpart to a specific network have the same value of SΔ (or Sws). For the WS models it is possible to show analytically that, under certain circumstances (constant re-wiring parameter and range), the small-world-ness SΔ will scale linearly with network size n. Intriguingly, a wide class of real-world networks also shows this linear scaling. Given this similarity in behavior, the assumption of (limited) topological correspondence of the WS model with real networks implies certain constraints on empirically measured parameters (like mean degree) of these networks. These constraints appear to hold, and so the ideas developed here provide further support for using the WS model in the study of small-world systems.
We have shown that the linear scaling between SΔ and n is not an inevitable property of networks; it would be possible, for example, to include networks with very large edge density that would destroy any linear scaling. However, in the event of linear scaling, there is a variety of possible scaling constants and there is a noisy growth process that could give rise to the networks sharing the same scale (slope) parameter. Finally, we have shown that the small-world networks used here do not maximize SΔ (there are ‘steeper’ linear relationships between SΔ and n).
We cannot, on the basis of the work presented here, answer the question of why small-world-ness was not maximised, but we can give some insights as to why this is the case. The possible explanations split into two broad classes of structural and dynamical limitations. Our use of the GKE model showed that the limited capacity of a system's nodes to maintain edges (whether due to physical cost, aging processes, or some other mechanism) is one structural limitation that could result in sub-maximal small-world-ness. Other structural limitations could include physical limits on node location and length of edges, such as might occur for the sub-stations and transmission wires in the power grid network.
Even if structural limitations were not an issue, then the system may have dynamical requirements that prevent it from maximising small-world-ness. The constraints placed on a system's topology by the dynamics required to fulfill its function are not well understood. Recent work has shown how the presence of particular network ‘motifs’ — repeating patterns of connections between a small number of nodes — can guarantee, for example, a chaotic attractor for the network as a whole . The functional requirements of some real-world system may then lead to the inclusion of particular motifs to guarantee the necessary dynamics , and there is no necessary link between a system's motifs and its global topological properties (of which small-world-ness is but one). Nonetheless, given that so many of the key motifs identified so far are either complete 3-node loops or contain them , , the global topology will have a high clustering coefficient, and will most likely be a small-world network.
Other systems may have constraints placed directly on their global topology, and this too could prevent maximisation of small-world-ness. For example, in his original work on the small-world model, Watts  explored the dynamics of Kuramoto oscillators on a WS model substrate, and showed that the fraction of synchronised oscillators had a phase transition that occurred for progressively smaller p as the oscillators' symmetric coupling strength increased (for fixed n, K). Therefore, if a system's function required it to be at the phase transition, so that it could rapidly switch between synchronised and desynchronised states with minimal perturbation, the required amount of (implied) rewiring may be far from that which maximised small-world-ness.
These are just a few of many possible explanations for why real-world systems do not maximise small-world-ness. Instead we might ask, when would small-world-ness be maximised? Maximum S essentially identifies the point in the network's possible topologies where the highest clustering is achieved for the smallest deviation from the shortest mean path length. Such a network would be optimal for message-passing, such that all the nodes receive a message in the shortest possible number of network steps . On this basis, we expect that some form of dynamic phenomenon, whether based on percolation (or, equivalently, epidemiological SIR models), oscillators, or some other general ordinary differential equation system, will have a strong correlation with small-world-ness. So, just as we have used a continuously graded ‘small-world-ness’ to quantitatively examine the topologies of the broad class of small-world networks, we may use this as the starting point for quantifying the continuum of dynamic properties that must also span this class.
Materials and Methods
Data-set of real-world systems
We collated a database of real-world networks' topological properties, combining published results with our own analyses of available data-sets. These are presented in Table 1, extending the previous considerable effort of collating topological properties by Mark Newman . All networks are treated as undirected. We list 33 real-world systems in total: we could compute Sws for all systems and SΔ for 27 systems — CΔ could not be found or computed for those systems.
We emphasise that the networks were not chosen for their ability to fit the linear model of S∝n. The majority of the data-set (21 of 33) were obtained from a previous collation : networks were only omitted from that prior data-set if neither Cws or CΔ were available for them (and hence were of no practical use to us here). Many of the additional networks we added filled sub-domains missing from the prior data-set, for example: the dolphin network  is an example of an animal social network; the cortical area connectivity map  is an example of large-scale neural connectivity. In addition, the regress-delete-regress sequence we used in the main text (and see below) shows two properties. First, that we could have applied that method to the data-set in Table 1 before further analysis, pruning the data-set down to those networks that showed the best fit to the linear model (by choosing the ‘most-deviant’ networks to omit), but did not. Second, that the linear scaling property is robust across randomly chosen sub-sets of the network data-set: on average, randomly deleting networks from the data-set did not significantly reduce the fit to the linear model.
Testing significance of S scores
We assess the significance of borderline small-world-ness scores S1 using Monte Carlo methods. The null hypothesis for the Watts-Strogatz definition of small-world networks is that the system is an Erdös-Rényi (E–R) random graph. We thus constructed N = 1000 E–R networks with the same number of nodes n and edges m for each tested real-world system, computing and for the ith E–R network. The 99% confidence limits for the null hypothesis were then defined for each system. We first found the central 99% interval [a*, b*], that is (22)and similarly for Sws. The 99% confidence interval for the system is then(23)The upper 99% confidence limit is then CL0.01 = 1 + CI (where by definition Sws, SΔ = 1 for an E–R random graph). A network with S>CL0.01 was therefore considered to significantly differ from a random network. We note that adopting a quantitative definition (Definition 2) of small-world-ness has led us to a procedure for a general statistical test for the presence of small-world structure, as defined by Watts and Strogatz , which is particularly useful for establishing meaningful departures from randomness in small networks.
Fits to linear scaling
Least-squares regressions on small-world-ness S and number of edges m against size of system n were performed on log10-transformed data to normalize magnitude of errors across range of n. Best fit linear model log10(x) = a+blog10(n) back-transformed to a linear basis, giving x = αnβ, where α = 10a and β = b. MATLAB (Mathworks) function regress was used to perform the regressions. The validity of r2 significance values was established by confirming that the residuals of each regression had a normal distribution at p = 0.01 using the Anderson-Darling test .
A regress-delete-regress procedure for testing robustness of predictions
We test the effect of real-world networks deviating from the constant 〈k〉 assumption using the following iterative procedure:
- regress n vs m for the data-set (as in Figure 2B);
- select network to remove from data-set based on regression outcome (3 different selection criteria were used, detailed below);
- regress n vs S for reduced data-set and record new goodness-of-fit (as r2);
- repeat from step 1 until 50% of networks removed.
We do this for 3 selection cases in step 2. First, we tested removing the network with the largest deviation from m∝n linear model in each iteration, hypothesizing that this should lead to an overall increase in fit to a linear model (increased r2) for S = f(n) if the WS model behaviour reflected that of real-world systems. Second, we tested removing the network with the smallest deviation from m∝n linear model at each iteration, hypothesizing that this should lead to an overall decrease in fit to a linear model (decreased r2) for S = f(n) if the WS model behaviour reflected that of real-world systems. Third, we tested random deletion, where a random network was deleted at each iteration, irrespective of the regression outcome, to establish the baseline effect of removing systems from the data-set. The first and second cases are unique sequences of deleted networks; the third case we repeated 1000 times.
Monte Carlo testing of linear scaling
We tested the dominance of linear S∝n scaling given an approximately constant mean node degree 〈k〉 and path length scaling β. For each Monte Carlo simulation, we drew 27 random C values from a uniform distribution in [0,1], computing αi for each from Eq. (19) with constant βi = 1 and 〈k〉i = 6. We then computed Si = αini for each, using a logarithmic spread of 27 network sizes to closely match the spread of the real-world system sizes. Linear regression (as detailed above, including the log10-transform) was then performed on the set of simulated 27 S values and the r2 recorded. We repeated this procedure 1000 times.
Searching GKE model parameter space
We wished to determine if the generalized Klemm-Eguiluz model (GKE),  model could explain the particular scaling relationships we found for the real-world systems:(24)(25)
We explored the (M, ρ) parameter space, searching over in steps of 1, and in steps of 0.1. The lower limit on M is set by the number of edges added per new vertex, and here we set d = 3 to give a mean degree of 〈k〉≈6 for a GKE model network, approximately the same degree that was implied by the linear m∝n relationship for the real-world systems. For each (M, ρ) pair, we constructed 5 GKE model networks for each value of and computed their Sws and SΔ scores. We took the mean of these 5 scores for each n, giving sets and . The fit of the GKE model networks was then assessed by computing the root mean square error (RMSE) between these mean values and those given by the scaling relationships (24) and (25) for the tested sizes of network n. The parameters that minimised RMSE are given in Figure 4; the error landscapes are shown in Figure S2.
Supporting information text
(0.22 MB PDF)
Correlation of real-world systems' clustering coefficient and path length ratios with system size. Clustering coefficient ratios (a) γΔ = CΔCrand and (b) γws = CwsCrand both scaled linearly with S. Linear regressions found r2≅0.86 in both cases. (c) As expected for small-world-networks, path length L was approximately the same as that of an E-R random graph, and so λ = L/Lrand1 for most networks (note that we show λ here for all 33 networks). All linear regressions performed on log10-transformed data, as detailed in Materials and Methods of the main text.
(0.11 MB TIF)
The root mean square error (RMSE) distribution across tested values of the GKE model parameters. The RMSE is computed based on the difference between the mean values of small-world-ness for a set of generated GKE networks and the corresponding small-world-ness values from the specific linear relationships found for the real-world systems. (a) RMSE error distribution for the fit to the Sws∝n relationship. RMSE plotted on log scale to emphasise valley of minimum values. Stick-and-ball indicates the parameter pair that minimised RMSE. (b) RMSE error distribution for the fit to the SΔ∝n relationship. Stick-and-ball indicates the parameter pair that minimised RMSE.
(0.44 MB TIF)
We thank M. Newman and M. Kaiser for making their data-sets publicly available, and T. Stafford and T. Prescott for comments on drafts of this manuscript.
Conceived and designed the experiments: MH KG. Performed the experiments: MH. Analyzed the data: MH KG. Contributed reagents/materials/analysis tools: MH. Wrote the paper: MH KG.
- 1. Newman MEJ (2003) The structure and function of complex networks. SIAM Review 45: 167–256.
- 2. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: Structure and function. Phys Rep 424: 175–308.
- 3. Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393: 440–442.
- 4. Lago-Fernandez LF, Huerta R, Corbacho F, Siguenza JA (2000) Fast response and temporal coherent oscillations in small-world networks. Phys Rev Lett 84: 2758–2761.
- 5. Barahona M, Pecora LM (2002) Synchronization in small-world systems. Phys Rev Lett 89: 054101.
- 6. Nishikawa T, Motter AE, Lai YC, Hoppensteadt FC (2003) Heterogeneity in oscillator networks: are smaller worlds easier to synchronize? Phys Rev Lett 91: 014101.
- 7. Roxin A, Riecke H, Solla SA (2004) Self-sustained activity in a small-world network of excitable neurons. Phys Rev Lett 92: 19801.
- 8. Little LR, McDonald AD (2007) Simulations of agents in social networks harvesting a resource. Ecol Model 204: 379–386.
- 9. Janssen MA, Jager W (2001) Fashions, habits and changing preferences: Simulation of psychological factors affecting market dynamics
- 10. Delre S, Jager W, Janssen M (2007) Diffusion dynamics in small-world networks with heterogeneous consumers. Comput Math Organ Theory 13: 185–202.
- 11. Keeling MJ, Eames KTD (2005) Networks and epidemic models. J R Soc Interface 2: 295–307.
- 12. Saramaki J, Kaski K (2005) Modelling development of epidemics with dynamic small-world networks. J Theor Biol 234: 413–421.
- 13. Netoff TI, Clewley R, Arno S, Keck T, White JA (2004) Epilepsy in small-world networks. J Neurosci 24: 8075–8083.
- 14. Newman ME, Moore C, Watts DJ (2000) Mean-field solution of the small-world network model. Phys Rev Lett 84: 3201–3204.
Bollobas M (2001) Random Graphs, 2nd Edition. Cambridge: Cambridge University Press.
- 16. Humphries MD, Gurney K, Prescott TJ (2006) The brainstem reticular formation is a small-world, not scale-free, network. Proc Biol Sci 273: 503–511.
- 17. Achard S, Salvador R, Whitcher B, Suckling J, Bullmore E (2006) A resilient, low-frequency, small-world human brain functional network with highly connected association cortical hubs. J Neurosci 26: 63–72.
- 18. Bassett DS, Meyer-Lindenberg A, Achard S, Duke T, Bullmore E (2006) Adaptive reconfiguration of fractal small-world human brain functional networks. Proc Natl Acad Sci USA 103: 19518–19523.
- 19. Sporns O (2006) Small-world connectivity, motif composition, and complexity of fractal neuronal connections. Biosystems 85: 55–64.
- 20. Bearman PS, Moody J, Stovel K (2004) Chains of affection: The structure of adolescent romantic and sexual networls. Am J Sociol 110: 44–91.
- 21. Martinez ND (1991) Artifacts or attributes? effects of resolution on the Little Rock Lake food web. Ecol Monogr 61: 367–392.
- 22. Wagner A, Fell DA (2001) The small world inside large metabolic networks. Proc Biol Sci 268: 1803–1810.
- 23. Newman ME, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev E 64: 026118.
- 24. Barrat A, Weigt M (2000) On the properties of small-world networks. Eur Phys J B 13: 147–160.
- 25. Newman ME (2003) Mixing patterns in networks. Phys Rev E 67: 026126.
- 26. Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74: 036104.
- 27. White JG, Southgate E, Thomson JN, Brenner S (1986) The structure of the nervous system of the nematode worm Caenorhabditis Elegans. Phil Trans Roy Soc B 314: 1–340.
Braitenberg V, Schuz A (1998) Cortex: Statistics and Geometry of Neuronal Connectivity. Berlin: Springer. 2nd edition.
- 29. Cohen R, Havlin S (2003) Scale-free networks are ultrasmall. Phys Rev Lett 90: 058701.
- 30. Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286: 509–512.
- 31. Amaral LA, Scala A, Barthelemy M, Stanley HE (2000) Classes of small-world networks. Proc Nat Acad Sci USA 97: 11149–11152.
- 32. Newman MEJ (2005) Power laws, Pareto distributions and Zipf's law. Contemporary Physics 46: 323–351.
- 33. Khanin R, Wit E (2006) How scale-free are biological networks. J Comput Biol 13: 810–818.
- 34. Klemm K, Eguiluz VM (2002) Growing scale-free networks with small-world behavior. Phys Rev E 65: 057102.
- 35. Tian L, Zhu CP, Shi DN, Gu ZM, Zhou T (2006) Universal scaling behavior of clustering coefficient induced by deactivation mechanism. Phys Rev E 74: 046103.
- 36. Zhigulin VP (2004) Dynamical motifs: building blocks of complex dynamics in sparsely connected random networks. Phys Rev Lett 92: 238701.
- 37. Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, et al. (2004) Superfamilies of evolved and designed networks. Science 303: 1538–1542.
- 38. Prill RJ, Iglesias PA, Levchenko A (2005) Dynamic properties of network motifs contribute to biological network organization. PLoS Biol 3: e343.
Watts DJ (1999) Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton: Princeton University Press.
- 40. Latora V, Marchiori M (2001) Efficient behaviour of small-world networks. Phys Rev Lett 87: 198701.
- 41. Lusseau D (2003) The emergent properties of a dolphin social network. Proc Biol Sci 270 Suppl 2: S186–S188.
- 42. Kaiser M, Hilgetag CC (2006) Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems. PLoS Comput Biol 2: e95.
- 43. Efron B (1979) Computers and the theory of statistics: Thinking the unthinkable. SIAM Review 21: 460–480.
- 44. Stephens MA (1974) EDF statistics for goodness of fit and some comparisons. J Am Stat Assoc 69: 730–737.
- 45. de Castro R, Grossman JW (1999) Famous trails to Paul Erdos. Math Intelligencer 21: 51–63.
- 46. Newman ME (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci USA 98: 404–409.
- 47. Ebel H, Mielsch LI, Bornholdt S (2002) Scale-free topology of e-mail networks. Phys Rev E 66: 035103.
- 48. Newman MEJ, Forrest S, Balthrop J (2002) Email networks and the spread of computer viruses. Phys Rev E 66: 035101.
Ozgur A, Bingol H (2004) Social network of co-occurrence in news articles. In: Aykanat C, Dayar T, Korpeoglu I, editors. Computer and Information Sciences - ISCIS 2004. Berlin: Springer. pp. 688–695. volume LNCS3280,.
- 50. Conyon MJ, Muldoon MR (2006) The small world of corporate boards. J Bus Finan Account 33: 1321–1343.
- 51. Albert R, Jeong H, Barabasi AL (1999) Diameter of the world-wide web. Nature 401: 130–131.
Knuth DE (1993) The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA.
- 53. Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. Comput Commun Rev 29: 251–262.
- 54. Sen P, Dasgupta S, Chatterjee A, Sreeram PA, Mukherjee G, et al. (2003) Small-world properties of the Indian railway network. Phys Rev E 67: 036106.
- 55. Valverde S, Ferrer Cancho R, Solé RV (2002) Scale-free networks from optimal design. Europhys Lett 60: 512–517.
- 56. Cancho RF, Janssen C, Solè RV (2001) Topology of technology graphs: small world patterns in electronic circuits. Phys Rev E 64: 046119.
- 57. Adamic LA, Lukose RM, Puniyani AR, Huberman BA (2001) Search in power-law networks. Phys Rev E 64: 046135.
- 58. Jeong H, Tombor B, Albert R, Oltvai ZN, Barabási AL (2000) The large-scale organization of metabolic networks. Nature 407: 651–654.
- 59. Jeong H, Mason SP, Barabasi AL, Oltvai ZN (2001) Lethality and centrality in protein networks. Nature 411: 41–42.
- 60. Huxham M, Beaney S, Raffaelli D (1996) Do parasites reduce the chances of triangulation in a real food web? Oikos 76: 284–300.