Abstract
Complex networks in natural, social and technological systems generically exhibit an abundance of rich information. Extracting meaningful structural features from data is one of the most challenging tasks in network theory. Many methods and concepts have been proposed to address this problem such as centrality statistics, motifs, community clusters and backbones, but such schemes typically rely on external and arbitrary parameters. It is unknown whether generic networks permit the classification of elements without external intervention. Here we show that link salience is a robust approach to classifying network elements based on a consensus estimate of all nodes. A wide range of empirical networks exhibit a natural, networkimplicit classification of links into qualitatively distinct groups, and the salient skeletons have generic statistical properties. Salience also predicts essential features of contagion phenomena on networks, and points towards a better understanding of universal features in empirical networks that are masked by their complexity.
Introduction
Many systems in physics, biology, social science, economics and technology are best modelled as a collection of discrete elements that interact through an intricate, complex set of connections. Complex network theory, a marriage of ideas and methods from statistical physics and graph theory, has become one of the most successful frameworks for studying these systems^{1,2,3,4,5,6,7} and has led to major advances in our understanding of transportation^{8,9,10,11}, ecological systems^{12,13}, social and communication networks^{14} and metabolic and gene regulatory pathways in living cells^{15,16,17}.
One of the challenges in complex network research is the identification of essential structural features that are typically masked by a network's complexity^{1,6,18,19,20}. Reducing a largescale network to its core components, filtering redundant information and extracting essential components are not only critical for efficient network data management. More importantly, these methods are often required to better understand evolutionary and dynamical processes on networks and to identify universal principles of network design or growth. In this context, the notion of centrality measures according to which nodes or links can be ranked is fundamental and epitomized by the node degree k, the number of directly connected neighbours of a node. Many systems, ranging from human sexual contacts^{21} to computer networks^{22}, are characterized by a powerlaw degree distribution p(k)∼k^{−(1+β)} with an exponent 0<β≤2. These networks are scalefree^{23}, meaning the majority of nodes are weakly connected and dominated by a few strongly connected nodes, known as hubs. Although a variety of networks can be understood in terms of their topological connectivity (the set of nodes and links), a number of systems are better captured by weighted networks in which links carry weights w that quantify their strengths^{8,24}. An important class of networks exhibit both a scalefree degree distribution and broadly distributed weights, which in some cases follow a powerlaw p(w)∼w^{−(1+β)}, with 1<α≤2.^{25,26,27} In addition to hubs, these networks thus possess highways. Several representative networks of this class are depicted in Fig. 1. Understanding the essential underlying structures in these networks is particularly challenging because of the mix of link and node heterogeneity.
Although classifications of network elements according to degree, weight or other centrality measures have been employed in many contexts^{9,28,29,30}, this approach comes with several drawbacks. The qualitative concepts of hubs and highways suggest a clearcut, networkintrinsic categorization of elements. However, these centrality measures are typically distributed continuously and generally do not provide a straightforward separation of elements into qualitatively distinct groups. At what precise degree does a node become a hub? At what strength does a link become a highway? Despite significant advances, current stateoftheart methods rely on systemspecific thresholds, comparisons to null models or imposed topological constraints^{6,11,31,32,33}. Whether generic heterogeneous networks provide a way to intrinsically segregate elements into qualitatively distinct groups remains an open question. In addition to this fundamental question, centrality thresholding is particularly problematic in heterogeneous networks as key properties of reduced networks can sensitively depend on the chosen threshold.
Here we address these problems by introducing the concept of link salience. The approach is based on an ensemble of nodespecific perspectives of the network, and quantifies the extent to which a consensus among nodes exists regarding the importance of a link. We show that salience is fundamentally different from link betweenness centrality and that it successfully classifies links into distinct groups without external parameters or thresholds. On the basis of this classification, we introduce the highsalience skeleton (HSS) of a network and compute this structure for a variety of networks from transportation, biology, sociology and economics. We show that despite major differences between representative networks, the skeletons of all networks exhibit similar statistical and topological properties and significantly differ from alternative backbone structures such as minimal spanning trees. Analysing traditional random network models, we demonstrate that neither broad weight nor degree distributions alone are sufficient to produce the patterns observed in real networks. Furthermore, we provide evidence that the emergence of distinct link classes is the result of the interplay of broadly distributed node degrees and link weights. We demonstrate how a static and deterministic analysis of a network based on link salience can successfully predict the behaviour of dynamical processes. We conclude that the large class of networks that exhibit broad weight and degree distributions may evolve according to fundamentally similar rules that give rise to similar core structures.
Results
Link salience
Weighted networks like those depicted in Fig. 1 can be represented by a symmetric, weighted N×N matrix W, where N is the number of nodes. Elements w_{ij}≥0 quantify the coupling strength between nodes i and j. Depending on the context, w_{ij} might reflect the passenger flux between locations in transportation networks, the synaptic strength between neurons in a neural network, the value of assets exchanged between firms in a trade network or the contact rate between individuals in a social network.
Our analysis is based on the concept of effective proximity d_{ij} defined by the reciprocal coupling strength d_{ij}=1/w_{ij}. Effective proximity captures the intuitive notion that strongly (weakly) coupled nodes are close to (distant from) each other^{34}. It also provides one way to define the length of a path p that connects two terminal nodes (n_{1},n_{k}) and consists of K−1 legs by a sequence of intermediate nodes n_{i}, and connections The shortest path minimizes the total effective distance and can be interpreted as the most efficient route between its terminal nodes^{35,36}; this definition of shortest path is used throughout this paper. In networks with homogeneous weights, shortest paths are typically degenerate and many different shortest paths coexist for a given pair of terminal nodes. In heterogeneous networks with realvalued weights shortest paths are typically unique. For a fixed reference node r, the collection of shortest paths to all other nodes defines the shortestpath tree (SPT; T(r)), which summarizes the most effective routes from the reference node r to the rest of the network. T(r) is conveniently represented by a symmetric N×N matrix with elements t_{ij}(r)=1 if the link (i,j) is part of at least one of the shortest paths and t_{ij}(r)=0 if it is not.
The central idea of our approach is based on the notion of the average SPT as illustrated in Fig. 2a. We define the salience S of a network as
so that S is a linear superposition of all SPTs. S can be calculated efficiently using a variant of a standard algorithm (see Supplementary Methods). According to this definition, the element 0≤s_{ij}≤1 of the matrix S quantifies the fraction of SPTs the link (i,j) participates in. As T(r) reflects the set of most efficient paths to the rest of the network from the perspective of the reference node, s_{ij} is a consensus variable defined by the ensemble of root nodes. If s_{ij}=1, then link (i,j) is essential for all reference nodes, if s_{ij}=0 the link has no role and if, say, s_{ij}=1/2 then link (i,j) is important for only half the root nodes. Note that although S is defined as an average across the set of SPTs, it is itself not necessarily a tree and is typically different from known structures such as minimal spanning trees (see Supplementary Fig. S1, Supplementary Table S3 and Supplementary Methods).
Robust classification of links
The most important and surprising feature of link salience is depicted in Fig. 2c. For the representative set of networks, we find that the distribution p(s) of link salience exhibits a characteristic bimodal shape on the unit interval. The networks' links naturally accumulate at the range boundaries with a vanishing fraction at intermediate values. Salience thus successfully classifies network links into two groups: salient (s≈1) or nonsalient (s≈0), and the large majority of nodes agree on the importance of a given link. As essentially no links fall into the intermediate regime, the resulting classification is insensitive to an imposed threshold, and is an intrinsic and emergent network property characteristic of a variety of strongly heterogeneous networks. This is fundamentally different from common link centrality measures such as weight or betweenness that possess broad distributions (see Fig. 1b), and which require external and often arbitrary threshold parameters for meaningful classifications.^{32,33}
The salience as defined by equation (1) permits an intuitive definition of a network's skeleton as a structure, which incorporates the collection of links that accumulate at s≈1. Fig. 2b depicts the skeleton for the networks of Fig. 1a. For all networks considered, only a small fraction of links are part of the HSS (6.76% for the air traffic network, 6.5% for the food web and 2.39% for the world trade network), and the topological properties of these skeletons are remarkably generic. Note that technically a separation of links into groups according to salience requires the definition of a threshold (e.g., we chose the centre of the salience range for convenience). The important feature is that the resulting groups are robust against changes in the value, as almost no links fall into intermediate ranges. Consequently the point of separation is almost arbitrary, yields almost identical skeletons for threshold ranges of 80% of the entire range. One of the common features of these skeletons is their strong disassortativity, irrespective of the assortativity properties of the corresponding original network (see Table 1). Furthermore, all skeletons exhibit a scalefree degree distribution
with exponents 1.1 ≤ β_{HSS} ≤ 2.5 (see Table 1 and Supplementary Fig. S2). As only links with s≈1 are present in the HSS, the degree of a node in the skeleton can be interpreted as the total salience of the node. The collapse onto a common scalefree topology is particularly striking as the original networks range from quasiplanar topologies with small local connectivity (the commuter network) to completely connected networks (worldwide trade). Note that the lowest exponent (weakest tail) is observed for the commuter network, as in a quasiplanar network the maximum number of salient connections is limited by the comparatively small degree of the original network. The scalefree structure of the HSS consequently suggests that networks that possess very different statistical and topological properties and that have evolved in a variety of contexts seem to selforganize into structures that possess a robust, disassortative backbone, despite their typical link redundancy.
Although these properties of link salience are encouraging and suggest novel opportunities for filtering links in complex weighted networks, for understanding hidden core substructures and suggest a new mechanism for defining a network's skeleton, a number of questions need to be addressed and clarified for the approach to be viable. First, a possible criticism concerns the definition of salience from SPTs, which suggests that s_{ij} can be trivially obtained from link betweenness b_{ij}, for example, by means of a nonlinear transform. Second, a bimodal p(s) may be a trivial consequence of broad weight distributions, if for instance large weights are typically those with s≈1. Finally, the observed bimodal shape of p(s) could be a property of any nontrivial network topology such as simple random weighted networks. In the following, we will address each of these concerns.
Salience and betweenness
The betweenness b_{ij} of a link (i,j) is the fraction of all ∼N^{2} shortest paths that pass through the link, whereas the salience s_{ij} is the fraction of N SPTs T(r) the link is part of. Despite the apparent similarity between these two definitions, both quantities capture very different qualities of links, as illustrated in Fig. 3. Betweenness is a centrality measure in the traditional sense^{40}, and is affected by the topological position of a link. Networks often exhibit a coreperiphery structure^{41} and the betweenness measure assigns a greater weight to links that are closer to the barycentre of the network^{39}. Salience, on the other hand, is insensitive to a link's position, acting as a uniform filter. This is illustrated schematically in the random planar network of Fig. 3a. High betweenness links tend to be located in the centre of the planar disk, whereas high salience links are distributed uniformly. A given shortest path is more likely to cross the centre of the disk, whereas the links of a SPT are uniformly distributed as they have to span the full network by definition. A detailed mathematical comparison of betweenness and salience is provided in the Methods. Fig. 3c depicts the typical relation of betweenness and salience in a correlogram for the worldwide air traffic network. The data cloud is broadly distributed within the range of possible values given by the inequalities (see Supplementary Methods)
Within these bounds no functional relationship between b and s exists. Given a link's betweenness b, one generally cannot predict its salience and vice versa. In particular, high salience links (s≈1) possess betweenness values ranging over many scales. The spread of data points within the theoretical bounds is typical for all the networks considered (see Supplementary Fig. S3). Links tend to collect at the righthand edge, corresponding to the upper peak in salience, and in particular at the lower right corner of the wedgeshaped region, corresponding to the heretofore unexplained peak in betweenness exhibited by several of the networks (cf. Fig. 1 and the dashed line in Fig. 3b). These edges have a maximal salience (all nodes agree on their importance) but the smallest betweenness possible, given this restriction (they are not well represented in the set of shortest paths). Such edges are the spokes in the hubandspoke structure: they connect a single node to the rest of the network, but are used by no others, and they are an essential piece of the HSS, as severing them removes some node's best link to the main body of the network. The presence of such links in the HSS explains why the weight values of s≈1 edges span such a wide range, as a link may have relatively low weight and yet be some node's most important connection.
Fig. 3d tests the hypothesis that strong link weights may yield strong values for salience. We observe that link betweenness is positively correlated with link weight and roughly follows a scaling relation w∼b^{γ} with γ≈0.2, in agreement with previous work on node centrality^{42}. This is not surprising as high weight links are by definition shorter and tend to attract shortest paths. In contrast, link weights exhibit no systematic dependence on salience, and in particular large weights do not generally imply a large salience. In fact, for fixed link salience the distribution of weights is broad with approximately the same median. Consequently, salience can be considered an independent centrality dimension that measures different features than correlated centrality measures such as weight and betweenness.
Origin of bimodal salience
All the networks we consider feature broad link weight distributions p(w) (see Fig. 1b), some of which can be reasonably modelled by power laws p(w)∼w^{−(1+α)} with exponents for many empirical data sets typically in the range 1<α<2 (ref. 38) (smaller α corresponds to a broader p(w)). Although it may seem plausible that strong links in the tail of these distributions dominate the structure of SPTs and thus cause the characteristic bimodal distribution of link salience, evidence against this hypothesis is already apparent in Fig. 3d: links with high salience exhibit weights across many scales, and in particular low weight links may possess high salience. Further evidence is provided in Fig. 4a, which depicts the salience distribution for fully connected networks for a sequence of exponent α. For values of α in the range observed in real networks, p(s) is peaked near s=0 and decreases with increasing s. A bimodal distribution of s only emerges when α is unrealistically small (α<1), and is much less pronounced than in real networks (cf. Fig. 2). We conclude that broad, scalefree weight distributions p(w) alone are insufficient to cause the natural, bimodal distribution p(s) observed in real networks.
Another potential source of the observed bimodality in p(s) is the topological heterogeneity of a scalefree degree distribution p(k)∼k^{−(1+β)} with 0<β≤2^{22,23,43}. Fig. 4b provides evidence that also a scalefree topology alone does not yield the characteristic bimodal salience distribution. In fact, the generic preferential attachment network^{23} (β=2) with uniform weights exhibits a distribution of salience that is almost the complement of the observed pattern with mostly intermediate values of link salience. The presence of hubs implies that any shortest paths seeking out a node in a hub's region will most likely route through that hub, and links emanating from this hub are more likely to appear in many SPTs. However, the hubandspoke structure of a preferential attachment network is only approximate; nodes that are at the end of a spoke are still likely to have random links to other areas of the network. For this reason, it is not typical in the uniformweight preferential attachment network to find links that appear in nearly all SPTs.
However, the observed bimodal distribution p(s) can be generated in random networks by a combination of weight and degree variability, a property characteristic of the class of networks discussed here. Fig. 4b also depicts p(s) for preferential attachment networks that possess a scalefree distribution of both degree k and weight w. As the weight distribution becomes broader (decreasing α), and even in the absence of explicit degree–weight correlations, we see the emergence of bimodality in the salience distribution in these networks. Topological hubs are more likely to have extremely highweight links simply because they have more links. Even when there is a topologically short path terminating at a spoke node that does not pass through the corresponding hub, it is less likely to be the shortest weighted path. Extreme weights amplify the effects of hubs by drawing more shortest paths through them. Moreover, Fig. 4c demonstrates that the emergence of bimodal salience does depend on the interplay between degree and weight distributions: the broader the degree distribution, the narrower the required weight distribution.
All of these results support the conclusion that a bimodal salience distribution is the characteristic of networks with strong heterogeneity in both topology and interaction strength, but that unweighted networks do not exhibit this property.
Applications to network dynamical systems
The relevance of link salience to dynamical processes that evolve on networks is an important issue, and one area of particular interest in network research is contagion phenomena. In this context, individuals in a population are represented by nodes and interaction propensities between pairs of nodes by a weighted network. Contagion phenomena are modelled by transmissions between nodes along the links of the network, where the likelihood of transmission is quantified by the link weights. The central question in this class of models is how the topological properties of the network shape the dynamics of the process. Link salience can also provide useful information about the behaviour of such a dynamical system. To illustrate this, we consider a simple stochastic susceptibleinfected (SI) epidemic model. At any given point in time, an infected node i can transmit a disease to susceptible nodes at a rate determined by the link weight w_{ij}. The details of the model are provided in Methods. We consider an epidemic on a planar disk network similar to that shown in Fig. 3a. A single node is chosen at random for the outbreak location. At every step of the process, each infected node randomly selects a neighbour to infect with probability proportional to the link weight; eventually the entire network is infected. By keeping track of which links were used in the infection process, one obtains the infection hierarchy H, a directed tree structure that represents the epidemic pathway through the network. As the process is stochastic, each realization of the process generates a different infection hierarchy. For different initial outbreak nodes and realizations of the process, we calculate an infection frequency h for each link: the number of times that link is used in the infection process, normalized by the number of realizations. The question is how successfully can link salience, a topological quantity, predict infection frequency h, a dynamic quantity. Fig. 5 shows the results for the two different link weight scenarios described in Methods. The top panel shows networks with link weights narrowly and uniformly distributed around a constant value w_{0}; in the bottom panel link, weights are broadly distributed according to a power law. In both cases, link salience is highly correlated with the frequency of a link's appearance in infection hierarchies h, whereas alternative link centrality measures such as weight and betweenness are not (see Fig. 5 insets and Supplementary Information). The link salience on average gives a much more accurate prediction of the virulence of a link than other available measures of centrality, suggesting that this type of completely deterministic, static analysis could nonetheless have an important role in considering how best to slow spreading processes in real networks.
Discussion
As much recent work in network theory has shown^{19,20,31,32}, there is tremendous potential for extracting heretofore hidden information from the complex interactions between the elements of a system. However, until now these methods have relied on externally imposed parameters or null models. Here we have shown that typical empirical networks taken from a variety of fields do in fact permit the robust classification of links according to the nodeconsensus procedure we introduce, and that this leads naturally to the definition of a HSS in these networks. Because vanishingly few links in empirical networks have intermediate values of salience, the identification of the skeleton is insensitive to a salience threshold; indeed, if a tunable filtering procedure is desired other methods may be more appropriate. Not all networks possess a skeleton; simple unweighted models have a shortestpath structure spread throughout the links. However, the presence of a skeleton is a generic feature of many heterogeneously weighted, empirical networks. We suggest that the likely cause in real networks is a hubandspoke topological structure along with a broad weight distribution, which amplifies the tendency of hubs to capture shortest paths.
We believe that the concept of salience and the HSS will become a vital component in understanding networks of the type discussed here and the development of networkbased dynamical models. The simple SI model we investigate here is only a starting point; it may be possible to leverage knowledge of a network's HSS to develop dynamical models that do not require simulation on (or even knowledge of) the full network. The generic bimodal salience distribution in this context also implies that in contagion phenomena, only a small subset of links might typically be active even if the process is stochastic. Those links, however, are almost certainly active irrespective of the outbreak location and the stochasticity of the process, which implies that in this regime the process becomes more predictable and the impact of stochasticity is decreased. This effect may shed a new light on the impact of stochastic factors in disease dynamical processes that evolve in strongly heterogeneous networks.
Many of the networks we considered evolved over long periods of time subject to external constraints and unknown optimization principles. The discovery that pronounced weight and degree heterogeneity, which are defining properties of the investigated networks, go hand in hand with generic properties in their underlying skeleton indicate that looking for common evolution principles could be another promising direction of further research.
Methods
Network data sources
Table 2 gives a brief definition of each network we examine here, and below we provide a summary of the networks along with data sources and references.
The Cash flow network was constructed from data collected through the Where's George billtracking website (http://www.wheresgeorge.com). The nodes are the 3,106 counties in the 48 United States excluding Alaska and Hawaii, and the links measure the number of bills passing between pairs of counties per time. This network has been previously analysed^{6,10,26}; see in particular the supplement to Thiemann et al.^{6} for a wealth of detailed information regarding the construction and statistics of this network, as well as strong evidence for interpreting it as proxy for individual mobility. The network of cash flow is constructed from ∼10 million individual bank notes that circulate in the United States.
The Air traffic network measures global air traffic based on flight data provided by OAG Worldwide Ltd. (http://www.oag.com) and includes all scheduled commercial flights in the world. Nodes represent airports worldwide. Link weights measures the total number of passengers traveling between a pair of networks by direct flights per year. This network is wellrepresented in the literature^{8,9,25,43,44}; we reduce it to 95% flux as described in WoolleyMeza et al.^{45} Total traffic in this network amounts to ∼3 billion passengers per year.
The Shipping network quantifies international marine freight traffic based on data provided by IHS Fairplay (http://www.ihs.com/products/maritimeinformation/index.aspx) which includes itineraries for 16,363 container ships. Nodes represent ports, and links measure the number of commercial cargo vessels traveling between those ports during 2007. The network is available at http://www.mathmod.icbm.de/45365.html and further discussion can be found in Kaluza et al.^{46}
The Commuting network is based on surveys conducted by the US Census Bureau during the 2000 census, and reflects the daily commuter traffic between US counties; the data is publicly available at http://www.census.gov/population/www/cen2000/commuting/files/2KRESCO_US.zip. Nodes in this network represent the counties of the 48 states excluding Alaska and Hawaii, and links measure the number of people commuting between pairs of counties per day.
The Neural network is derived from the Caenorhabditis elegans nematode. Nodes represent neurons, and links measure the number of synapses or gap junctions connecting a pair of neurons. Experimental data is described in White et al.^{47} and analysed in Watts and Strogatz^{48}; the network is available at http://wwwpersonal.umich.edu/mejn/netdata/.
The metabolic network measures interactions in the bacterium Escherichia coli^{16,49}. Nodes represent metabolites and links measure effective kinetic rates of reactions a pair of metabolites participates in. We use only the largest connected component of this network.
The Food web network is a representative food web from a list of publicly available data sets of the same type (see http://vlado.fmf.unilj.si/pub/networks/data/bio/foodweb/foodweb.htm for networks in Pajek format, a report^{50} on trophic analysis of the Florida Bay food web available at http://www.cbl.umces.edu/atlss/FBay701.html and Serrano et al.^{32} and Radicchi et al.^{33}). Nodes represent species in the Florida Bay ecosystem, and links measure the consumed biomass in grams of carbon per year across a link.
In the Interindustry network, nodes represent industrial sectors in the United States and their connections are computed from inputoutput tables prepared by the US Bureau of Economic Analysis available at http://www.bea.gov/industry/io_benchmark.htm. We use data from 2002, the most recent year for which measurements are available. Nodes in this network represent particular industries (for example, 'tobacco production' or 'cutlery and hand tool manufacturing') and links measure an average interaction between two industries. Given two industries x and y, inputoutput data measures the amount (United States dollars, USD) of input x demands from y to produce one dollar of output, and we take the weight of the link connecting x and y to be the geometric mean of the inputoutput demand of x on y and y on x.
The World trade network is based on data prepared by the United States National Bureau of Economic Research and measures the value (in nominal thousands of USD) of goods traded between countries from 1962 to 2000. Nodes represent countries and links measure the value of goods traded between countries. The data and extensive documentation are available at http://www.cid.econ.ucdavis.edu/data/undata/undata.html. A series of papers analyses a similar data set from a different source^{33,51,52,53}.
The Collaboration network is based on coauthorship of academic papers in the highenergy physics community from 1995 to 1999. Nodes represent individuals and links measure the number of papers coauthored^{54}. The data is publicly available at http://wwwpersonal.umich.edu/mejn/netdata/.
Link salience and betweenness centrality
Link salience s and betweenness centrality b are based on the notion of shortest paths in weighted networks. Given a weighted network defined by the weight matrix w_{ij} (not necessarily symmetric) and a shortest path that originates at node x and terminates at node y it is convenient to define the indicator function
A shortest path tree T(x) rooted at node x can be represented as a matrix with elements
and salience s_{ij} of link i→j is given by
where 〈·〉_{v} denotes the average across the set of root nodes x.
Betweenness, on the other hand, is defined according to
where ${\u3008\xb7\u3009}_{{V}^{\text{2}}}$ denotes the average over all N^{2} pairs of terminal nodes. The relation of betweenness and salience can be made more transparent by rewriting this expectation value as a sequential average over all nodes,
with
fixing root node x. Thus, b_{ij}(x) is the conditional betweenness of link i→j if the set of shortest paths is restricted to those terminating at x. From this it follows that
Comparing (5) with (4) we see that the difference of salience and betweenness is equivalent to the difference in the shortest path trees T_{ij}(x) and the conditional betweenness b_{ij}(x), whereas all links in the SPT are weighted equally, links with nonzero conditional betweenness tend to become less central as the links become further separated from the root node x. Formally, we can write
with Θ(x)=1 if x>0 and Θ(x)=0 otherwise.
Epidemic simulations
To determine the relevance of link salience to contagion phenomena on networks, we investigated the correlation of link salience and the frequency at which links participate in a generic contagion process that spreads through planar, random triangular networks.
Each network consists of N=100 nodes distributed uniformly at random in a planar disk; the links of the network are given by the Delaunay triangulation of the nodes. The planar distance between nodes is roughly proportional to the number of links in a shortest (network) path between them. A representative example of this type of topology is shown in Fig. 3a. We consider two different weight scenarios:

1
Quasihomogeneous weights: Each link is assigned a unit weight w modified by an additive, small perturbation ξ
where ξ is uniformly distributed in the interval (−0.01, 0.01)

2
Broadly distributed weights: Each link is assigned a random weight from the distribution with PDF
We simulate a stochastic SI epidemic process. A single stochastic realization of the process is generated as follows: given a network represented by the symmetric weight matrix w_{ij}, which quantifies the interaction strength of a pair of nodes, we define the probability P_{ij} that node j infects node i in a fixed time interval Δt
where γ≪1/Δt is the infection rate and Time proceeds in discrete steps; at each step each infected node j chooses an adjacent node to infect at random with probabilities given by P_{ij}. If node j infects a susceptible node i, then the link (j,i) is added to the infection hierarchy H, which can be represented as a matrix H_{ji}. In the longtime limit, every node is infected, and H is a tree structure recording the first infection paths from the outbreak location s to every other node.
For a given network, we compute R=1,000 different epidemic realizations with random outbreak locations s_{k}, resulting in an ensemble of infection hierarchies H^{(k)}_{mn.} The key question is, how frequently does a link in the network participate in an epidemic, and we define the infection frequency of a link as
We compute the infection frequency for 100 random networks under each weight scenario, and Fig. 5 illustrates the degree to which the directed salience s_{mn} is a predictor of the dynamic quantity h_{mn}. The correlation of h_{mn} with directed salience and the two measures of centrality we consider here, weight w_{mn} and betweenness b_{mn}, is shown in Table 3.
Additional information
How to cite this article: Grady, D. et al. Robust classification of salient links in complex networks. Nat. Commun. 3:864 doi: 10.1038/ncomms1847 (2012).
References
 1
Newman, M. E. J. The structure and function of complex networks. SIAM Rev 45, 167–256 (2003).
 2
Strogatz, S. H. Exploring complex networks. Nature 410, 268–76 (2001).
 3
Albert, R. & Barabási, A. L. Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47–97 (2002).
 4
Boccaletti, S., Latora, V., Moreno, Y., Chavez, M. & Hwang, D. Complex networks: structure and dynamics. Phys. Rep. 424, 175–308 (2006).
 5
Vespignani, A. Predicting the behavior of technosocial systems. Science 325, 425–428 (2009).
 6
Thiemann, C., Theis, F., Grady, D., Brune, R. & Brockmann, D. The structure of borders in a small world. PLoS ONE 5, e15422 (2010).
 7
Brockmann, D. Following the money. Phys. World 23, 31–34 (2010).
 8
Barrat, A., Barthélemy, M., PastorSatorras, R. & Vespignani, A. The architecture of complex weighted networks. PNAS 101, 3747–3752 (2004).
 9
Guimerà, R., Mossa, S., Turtschi, A. & Amaral, L. A. N. The worldwide air transportation network: anomalous centrality, community structure, and cities' global roles. PNAS 102, 7794–7799 (2005).
 10
Brockmann, D., Hufnagel, L. & Geisel, T. The scaling laws of human travel. Nature 439, 462–465 (2006).
 11
WoolleyMeza, O. et al. Complexity in human transportation networks: a comparative analysis of worldwide air transportation and global cargo ship movements. Eur. Phys. J. B 84, 589–600 (2011).
 12
Allesina, S., Alonso, D. & Pascual, M. A general model for food web structure. Science 320, 658–661 (2008).
 13
Camacho, J., Guimerà, R. & Amaral, L. A. N. Robust patterns in food web structure. Phys. Rev. Lett. 88, 8–11 (2002).
 14
Lazer, D. et al. Computational social science. Science 323, 721–723 (2009).
 15
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N. & Barabási, A. L. The largescale organization of metabolic networks. Nature 407, 651–654 (2000).
 16
Almaas, E., Kovács, B., Vicsek, T., Oltvai, Z. N. & Barabási, A. L. Global organization of metabolic fluxes in the bacterium Escherichia coli. Nature 427, 839–843 (2004).
 17
Barabási, A. L. & Oltvai, Z. N. Network biology: understanding the cell's functional organization. Nat. Rev. Genet. 5, 101–113 (2004).
 18
Ravasz, E. & Barabási, A. L. Hierarchical organization in complex networks. Phys. Rev. E 67, 1–7 (2003).
 19
Alon, U. Network motifs: theory and experimental approaches. Nat. Rev. Genet. 8, 450–461 (2007).
 20
Newman, M. E. J. & Girvan, M. Finding and evaluating community structure in networks. Phys. Rev. E 69, 26113 (2004).
 21
Liljeros, F., Edling, C. R., Amaral, L. A. N., Stanley, H. E. & Åberg, Y. The web of human sexual contacts. Nature 411, 907–908 (2001).
 22
Kleinberg, J. & Lawrence, S. The structure of the web. Science 294, 1849–1850 (2001).
 23
Barabási, A. L. & Albert, R. Emergence of scaling in random networks. Science 286, 509–512 (1999).
 24
Newman, M. E. J. Analysis of weighted networks. Phys. Rev. E 70, 56131 (2004).
 25
Colizza, V., Barrat, A., Barthélemy, M. & Vespignani, A. The role of the airline transportation network in the prediction and predictability of global epidemics. PNAS 103, 2015–2020 (2006).
 26
Brockmann, D. & Theis, F. Moneycirculation, trackable items, and the emergence of universal human mobility patterns. IEEE Pervasive Computing 7, 28–35 (2008).
 27
Hufnagel, L., Brockmann, D. & Geisel, T. Forecast and control of epidemics in a globalized world. Proc. Natl. Acad. Sci. USA 101, 15124–15129 (2004).
 28
Borgatti, S. P. & Everett, M. G. A graphtheoretic perspective on centrality. Soc. Networks 28, 466–484 (2006).
 29
Wu, Z., Braunstein, L. A., Havlin, S. & Stanley, H. E. Transport in weighted networks: partition into superhighways and roads. Phys. Rev. Lett. 96, 1–4 (2006).
 30
Wang, H., Hernandez, J. M. & Van Mieghem, P. Betweenness centrality in a weighted network. Phys. Rev. E 77, 1–10 (2008).
 31
Tumminello, M., Aste, T., Di Matteo, T. & Mantegna, R. N. A tool for filtering information in complex systems. PNAS 102, 10421–10426 (2005).
 32
Serrano, M. A., Boguñá, M. & Vespignani, A. Extracting the multiscale backbone of complex weighted networks. PNAS 106, 6483–6488 (2009).
 33
Radicchi, F., Ramasco, J. J. & Fortunato, S. Information filtering in complex weighted networks. Phys. Rev. E 83, 1–9 (2011).
 34
Caldarelli, G ScaleFree Networks: Complex Webs in Nature and Technology (Oxford University Press, USA, 2007).
 35
Dijkstra, E. W. A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959).
 36
Newman, M. E. J. Networks: An Introduction (Oxford University Press, USA, 2010).
 37
Newman, M. E. J. Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002).
 38
Clauset, A., Shalizi, C. R. & Newman, M. E. J. Powerlaw distributions in empirical data. SIAM Rev. 51, 661–703 (2009).
 39
Barthélemy, M. Spatial networks. Phys. Rep. 499, 1–101 (2011).
 40
Freeman, L. C. A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977).
 41
Holme, P. Coreperiphery organization of complex networks. Phys. Rev. E 72, 46111 (2005).
 42
Dall'Asta, L., Barrat, A., Barthélemy, M. & Vespignani, A. Vulnerability of weighted networks. J. Stat. Mech. Theor. Exp. 2006, P04006–P04006 (2006).
 43
Guimerà, R., SalesPardo, M. & Amaral, L. A. N. Classes of complex networks defined by roletorole connectivity profiles. Nat. Phys. 3, 63–69 (2007).
 44
SalesPardo, M., Guimerà, R., Moreira, A. A. & Amaral, L. A. N. Extracting the hierarchical organization of complex systems. PNAS 104, 15224–15229 (2007).
 45
WoolleyMeza, O., Grady, D ., Bagrow, J.P., & Brockmann, D. Eyjafjallajökull and 9/11: The impact of disasters on the worldwide airtraffic, In Preparation (2012).
 46
Kaluza, P., Kölzsch, A., Gastner, M. T. & Blasius, B. The complex network of global cargo ship movements. J. R. Soc. Interface 7, 1093–1103 (2010).
 47
White, J. G., Southgate, E., Thomson, J. N. & Brenner, S. The structure of the nervous system of the nematode Caenorhabditis elegans. Phil. Trans. R. Soc. London 314, 1–340 (1986).
 48
Watts, D. J. & Strogatz, S. H. Collective dynamics of 'smallworld' networks. Nature 393, 440–442 (1998).
 49
Reed, J. L., Vo, T. D., Schilling, C. H. & Palsson, B. O. An expanded genomescale model of Escherichia coli K12 (iJR904 GSM/GPR). Genome Biol 4, R54 (2003).
 50
Ulanowicz, R. E., Bondavalli, C. & Egnotovich, M. S. Network analysis of trophic dynamics in south florida ecosystem. FY 97: the Florida Bay ecosystem. Technical report, CBL 98–123 (1998) .
 51
Garlaschelli, D. & Loffredo, M. Fitnessdependent topological properties of the world trade web. Phys. Rev. Lett. 93, 1–4 (2004).
 52
Garlaschelli, D. & Loffredo, M. Structure and evolution of the world trade network. Physica A: Stat. Mech. Appl. 355, 138–144 (2005).
 53
Serrano, M. & Boguñá, M. Topology of the world trade web. Phys. Rev. E 68, 1–4 (2003).
 54
Newman, M. E. J. The structure of scientific collaboration networks. PNAS 98, 404–409 (2001).
Acknowledgements
We thank O WoolleyMeza, R Brune, M Schnabel, J Bagrow, H Schlämmer and B Kath for many helpful discussions, and B Blasius, A Motter and B Uzzi for pointing out and providing some of the data sets. We acknowledge support from the Volkswagen Foundation and EUFP7 grant Epiwork.
Author information
Affiliations
Contributions
D.G., C.T. and D.B. contributed in designing the research. D.G. and D.B. helped in developing the theory. D.G., C.T. and D.B. analysed the data. D.G. performed epidemic simulations. D.G. and D.B. wrote the manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing financial interests.
Supplementary information
Supplementary Information
Supplementary Figures S1S3, Supplementary Tables S1S3, Supplementary Methods and Supplementary References. (PDF 1093 kb)
Rights and permissions
About this article
Cite this article
Grady, D., Thiemann, C. & Brockmann, D. Robust classification of salient links in complex networks. Nat Commun 3, 864 (2012). https://doi.org/10.1038/ncomms1847
Received:
Accepted:
Published:
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.