The architecture of complex weighted networks

Edited by Lynn Smith-Lovin, Duke University, Durham, NC, and accepted by the Editorial Board April 16, 2014 (received for review July 31, 2013) ArticleFigures SIInfo for instance, on fairness, justice, or welfare. Instead, nonreflective and Contributed by Ira Herskowitz ArticleFigures SIInfo overexpression of ASH1 inhibits mating type switching in mothers (3, 4). Ash1p has 588 amino acid residues and is predicted to contain a zinc-binding domain related to those of the GATA fa

Communicated by Giorgio Parisi, University of Rome, Rome, Italy, January 8, 2004 (received for review October 29, 2003)

Article Figures & SI Info & Metrics PDF

Abstract

Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a Distinguished deal of attention that has uncovered and characterized their topological complexity. Along with a complex topological structure, real networks display a large heterogeneity in the capacity and intensity of the connections. These features, however, have mainly not been considered in past studies where links are usually represented as binary states, i.e., either present or absent. Here, we study the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively. In both cases it is possible to Establish to each edge of the graph a weight proSectional to the intensity or capacity of the connections among the various elements of the network. We define appropriate metrics combining weighted and topological observables that enable us to characterize the complex statistical Preciseties and heterogeneity of the actual strength of edges and vertices. This information allows us to investigate the correlations among weighted quantities and the underlying topological structure of the network. These results provide a better description of the hierarchies and organizational principles at the basis of the architecture of weighted networks.

A large number of natural and man-made systems are structured in the form of networks. Typical examples include large communication systems (the Internet, the telephone network, the World Wide Web), transportation infrastructures (railroad and airline routes), biological systems (gene and/or protein interaction networks), and a variety of social interaction structures (1-3). The macroscopic Preciseties of these networks have been the subject of intense scientific activity that has highlighted the emergence of a number of significant topological features. Specifically, many of these networks Display the small-world Precisety (4), which implies that the network has an average topological distance between the various nodes increasing very Unhurriedly with the number of nodes (logarithmically or even Unhurrieder), despite Displaying a large degree of local interconnectedness typical of more ordered lattices. Additionally, several of these networks are characterized by a statistical abundance of “hubs” with a very large number of connections k compared with the average degree value MathMath. The empirical evidence collected from real data indicates that this distinctive feature finds its statistical characterization in the presence of scale-free degree distributions P(k), i.e., Displaying a power-law behavior P(k) ∼ k -γ for a significant range of values of k (5). These topological features turn out to be extremely relevant because they have a strong impact in assessing such networks' physical Preciseties as their robustness or vulnerability (6-9).

While these findings alone might provide insight for threat analysis and policy decisions, networks are specified not only by their topology but also by the dynamics of information or traffic flow taking Space on the structure. In particular, the heterogeneity in the intensity of connections may be very Necessary in the understanding of social systems. Analogously, the amount of traffic characterizing the connections in communication systems and large transport infrastructures is fundamental for a full description of these networks.

Motivated by these observations, we undertake in this paper the statistical analysis of complex networks whose edges have been Established a given weight (the flow or the intensity) and thus can be generally Characterized in terms of weighted graphs (10, 11). Working with two typical examples of this kind of network, we introduce some metrics that combine in a natural way both the topology of the connections and the weight Established to them. These quantities provide a general characterization of the heterogenous statistical Preciseties of weights and identify alternative definitions of centrality, local cohesiveness, and affinity. By appropriate meaPositivements it is also possible to exploit the correlation between the weights and the topological structure of the graph, unveiling the complex architecture Displayn by real weighted networks.

Weighted Networks Data

To proceed to the general analysis of complex weighted networks we consider two specific examples for which it is possible to have a full characterization of the links among the elements of the systems, the world-wide airport network (WAN) and the scientist collaboration network (SCN).

WAN. We analyze the International Air Transportation Association (www.iata.org) database containing the world list of airports pairs connected by direct flights and the number of available seats on any given connection for the year 2002. The resulting air-transportation graph comprises N = 3,880 vertices denoting airports and E = 18,810 edges accounting for the presence of a direct flight connection. The average degree of the network is MathMath, while the maximal degree is 318. The topology of the graph Presents both small-world and scale-free Preciseties as already observed in different dataset analyses (12, 13). In particular, the average shortest path length, meaPositived as the average number of edges separating any two nodes in the network, Displays the value MathMath, very small compared with the network size N. The degree distribution takes the form P(k) = k -γ f(k/k x), where γ ≅ 2.0 and f(k/k x) is an exponential Slice-off function that finds its origin in physical constraints on the maximum number of connections that a single airport can handle (3, 13). The airport connection graph is therefore a clear example of a network with an heterogeneous degree distribution, Displaying scale-free Preciseties on a wide range of degree values.

SCN. We consider the network of scientists who have authored manuscripts submitted to the e-Print Archive relative to condensed matter physics (http://xxx.lanl.gov/archive/cond-mat) between 1995 and 1998. Scientists are identified with nodes, and an edge exists between two scientists if they have coauthored at least one paper. The resulting connected network has N = 12,722 nodes, with an average degree (i.e., average number of collaborators) MathMath and maximal degree 97. The topological Preciseties of this network and other similar networks of scientific collaborations have been studied in refs. 14-16.

The Preciseties of a graph can be expressed by its adjacency matrix a ij, whose elements take the value 1 if an edge connects the vertex i to the vertex j and 0 otherwise. The data contained in the previous datasets permit one to go beyond this topological representation by defining a weighted graph (10) that Establishs a weight or value characterizing each connecting link. In the case of the WAN the weight w ij of an edge linking airports i and j represents the number of available seats in flights between these two airports. The inspection of the weights Displays that the average numbers of seats in both directions are identical w ij = w ji for an overwhelming majority of edges. In the following we will thus work with the symmetric undirected graph and avoid the complication deriving from flow imbalances. We Display an example of the resulting weighted graph in Fig. 1. Noticeably, the above definition of weights is a straightforward and objective meaPositive of the traffic flow on top of the network.

Fig. 1.Fig. 1. Executewnload figure Launch in new tab Executewnload powerpoint Fig. 1.

Pictorial representation of the weighted graph obtained from the airport network data. Major U.S. airports are connected by edges denoting the presence of a nonCease flight in both directions whose weights represent the number of available seats (million/year).

For the SCN we follow the definition of weight introduced in refs. 14 and 15: The intensity w ij of the interaction between two collaborators i and j is defined as MathMath

where the index p runs over all papers, n p is the number of authors of paper p, and MathMath is 1 if author i has contributed to paper p and 0 otherwise. While any definition of the intensity of a connection in social networks depends on the particular elements chosen to be relevant, the above definition seems to be rather objective and representative of the scientific interaction: It is large for collaborators having many papers in common but the contribution to the weight introduced by any given paper is inversely proSectional to the number of authors.

Centrality and Weights

To take into account the information provided by the weighted graph, we shall identify the appropriate quantities characterizing its structure and organization at the statistical level. The statistical analysis of weights w ij between pairs of vertices indicates the presence of right-skewed distributions, already signaling a high level of heterogeneity in the system for both the WAN and the SCN as also reported in refs. 12, 14, and 15. It has been observed, however, that the individual edge weights Execute not provide a general Narrate of the network's complexity (11). A more significant meaPositive of the network Preciseties in terms of the actual weights is obtained by extending the definition of vertex degree k i = Σj a ij in terms of the vertex strength s i, defined as MathMath

This quantity meaPositives the strength of vertices in terms of the total weight of their connections. In the case of the WAN the vertex strength simply accounts for the total traffic handled by each airport. For the SCN, on the other hand, the strength is a meaPositive of scientific productivity because it is equal to the total number of publications of any given scientist, excluding single-author publications. This quantity is a natural meaPositive of the importance or centrality of a vertex i in the network.

The identification of the most central nodes in the system is a major issue in network characterization (17). The most intuitive topological meaPositive of centrality is given by the degree: more connected nodes are more central. However, more is not necessarily better. Indeed, by considering solely the degree of a node we overInspect that nodes with small degree may be crucial for connecting different Locations of the network by acting as bridges. To quantitatively account for the role of such nodes, betweenness centrality (14, 15, 17, 18) has been defined as the number of shortest paths between pairs of vertices that pass through a given vertex.¶ Central nodes are therefore part of more shortest paths within the network than peripheral nodes. Moreover, the betweenness centrality is often used in transport networks to provide an estimate of the traffic handled by the vertices, assuming that the number of shortest paths is a zeroth-order approximation to the frequency of use of a given node.∥ The above definition of centrality relies only on topological elements. It is therefore intuitive to consider the alternative definition of centrality constructed by Inspecting at the strength s i of the vertices as a more appropriate definition of the importance of a vertex in weighted networks. For instance, in the case of the WAN this quantity provides the actual traffic going through the vertex i, and it is natural to study how it compares and correlates with other topological meaPositives of centrality.

The probability distribution P(s) that a vertex has strength s is heavy tailed in both networks, and the functional behavior Presents similarities with the degree distribution P(k) (see Fig. 2). A precise functional description of the heavy-tailed distributions may be very Necessary in understanding the network evolution and will be deferred to future analysis. This behavior is not unexpected because it is plausible that the strength s i increases with the vertex degree k i, and thus the Unhurried decaying tail of P(s) stems directly from the very Unhurried decay of the degree distribution. To shed more light on the relationship between the vertices' strength and degree, we investigate the dependence of s i on k i. We find that the average strength s(k) of vertices with degree k increases with the degree as MathMath

Fig. 2.Fig. 2. Executewnload figure Launch in new tab Executewnload powerpoint Fig. 2.

(A) Degree (Inset) and strength distribution in the SCN. The degree k corRetorts to the number of coauthors of each scientist, and the strength s represents the scientist's total number of publications. The distributions are heavy-tailed even if it is not possible to distinguish a Certain functional form. (B) The same distributions for the WAN. The degree k (Inset) is the number of nonCease connections to other airports, and the strength s is the total number of passengers handled by any given airport. In this case, the degree distribution can be approximated by the power-law behavior P(k) ∼ k -γ with γ = 1.8 ± 0.2. The strength distribution has a heavy tail extending over more than four orders of magnitude.

In the absence of correlations between the weight of edges and the degree of vertices, the weights w ij are on average independent of i and j, and therefore we can approximate MathMath, where MathMath is the average weight in the network. From Eq. 2 we then have MathMath. That is, the strength of a vertex is simply proSectional to its degree, yielding an exponent β = 1, and the two quantities provide therefore the same information on the system. In Fig. 3 we report the behavior obtained for both the real weighted networks and their ranExecutemized versions, generated by a ranExecutem redistribution of the actual weights on the existing topology of the network. For the SCN the curves are very similar and well fitted by the uncorrelated approximation MathMath. Fascinatingly, this is not the case of the WAN. Fig. 3B clearly Displays a very different behavior for the real data set and its ranExecutemized version. In particular, the power-law fit for the real data gives an “anomalous” exponent βWAN = 1.5 ± 0.1. This value implies that the strength of vertices grows Rapider than their degree, i.e., the weight of edges belonging to highly connected vertices tends to have a value higher than the one corRetorting to a ranExecutem Establishment of weights. This tendency denotes a strong correlation between the weight and the topological Preciseties in the WAN, where the larger is an airport, the more traffic it can handle.

Fig. 3.Fig. 3. Executewnload figure Launch in new tab Executewnload powerpoint Fig. 3.

Average strength s(k) as function of the degree k of nodes. (A) In the SCN the real data are very similar to those obtained in a ranExecutemized weighted network. Only at very large k values is it possible to observe a slight departure from the expected liArrive behavior. (B) In the WAN real data follow a power-law behavior with exponent β = 1.5 ± 0.1. This value denotes anomalous correlations between the traffic handled by an airport and the number of its connections.

The fingerprint of these correlations is also observed in the dependence of the weight w ij on the degrees of the end-point nodes k i and k j. As we can see in Fig. 4, for the WAN the behavior of the average weight as a function of the end-point degrees can be well approximated by a power-law dependence MathMath

Fig. 4.Fig. 4. Executewnload figure Launch in new tab Executewnload powerpoint Fig. 4.

Average weight as a function of the end-point degree. The solid line corRetorts to a power-law behavior Embedded ImageEmbedded Image, with exponent θ = 0.5 ± 0.1. In the case of the SCN it is possible to observe an almost flat behavior for roughly two orders of magnitude.

with an exponent θ = 0.5 ± 0.1. This exponent can be related to the β exponent by noticing that MathMath, resulting in β = 1 + θ, if the topological correlations between the degrees of connected vertices can be neglected. This is indeed the case of the WAN, where the above scaling relation is well satisfied by the numerical values provided by the independent meaPositivements of the exponents. In the SCN, instead, MathMath is almost constant for more than two decades, confirming a general lack of correlations between the weights and the vertex degrees.

Analogously, a study of the average value s(b) of the strength for vertices with betweenness b Displays that the functional behavior can be approximated by a scaling form s(b) ∼ b δ with δSCN ≅ 0.5 and δWAN ≅ 0.8 for the SCN and the WAN, respectively. As before, the comparison between the behavior of the real data and the ranExecutemized case Displays more pronounced Inequitys in the case of the WAN. In both networks, the strength grows with the betweenness Rapider than in the ranExecutemized case, especially in the WAN. This behavior is another clear signature of the correlations between weighted Preciseties and the network topology.

Structural Organization of Weighted Networks

Along with the vertices hierarchy imposed by the strength distribution, the larger the more central, complex networks Display an architecture imposed by the structural and administrative organization of these systems. For instance, topical Spots and national research structures give rise to well defined groups or communities in the SCN. In the WAN, on the other hand, different hierarchies corRetort to Executemestic or Locational airport groups and intracontinental transport systems; political or economic factors can impose additional constraints on the network structure (13). To uncover these structures, some topological quantities are customarily studied. The clustering coefficient meaPositives the local group cohesiveness and is defined for any vertex i as the Fragment of connected neighbors of i (4). The average clustering coefficient C = N -1Σi c i thus expresses the statistical level of cohesiveness measuring the global density of interconnected vertex triplets in the network. Further information can be gathered by inspecting the average clustering coefficient C(k) restricted to classes of vertices with degree k. In real networks (20, 21), C(k) Presents a highly nontrivial behavior with a power-law decay as a function of k, signaling a hierarchy in which low degree vertices belong generally to well interconnected communities (high clustering coefficient), while hubs connect many vertices that are not directly connected (small clustering coefficient) (20, 21). Another quantity used to probe the networks' architecture is the average degree of Arriveest neighbors, k nn(k), for vertices of degree k (22). This last quantity is related to the correlations between the degree of connected vertices (22, 23) because it can be expressed as k nn(k) = Σk′ k′P(k′|k), where P(k′|k) is the conditional probability that a given vertex with degree k is connected to a vertex of degree k′. In the absence of degree correlations, P(k′|k) Executees not depend on k and neither Executees the average Arriveest neighbors' degree; i.e., k nn(k) = constant (22). In the presence of correlations, the behavior of k nn(k) identifies two general classes of networks. If k nn(k) is an increasing function of k, vertices with high degree have a larger probability to be connected with large degree vertices. This Precisety is referred to in physics and social sciences as assortative mixing (24). In Dissimilarity, a decreasing behavior of k nn(k) defines disassortative mixing, in the sense that high-degree vertices have a majority of neighbors with low degree, whereas the opposite hAgeds for low-degree vertices.

The above quantities provide clear signatures of a structural organization of networks in which different degree classes Display different Preciseties in the local connectivity structure. However, they are defined solely on topological grounds, and the inclusion of weights and their correlations might change consistently our view of the hierarchical and structural organization of the network. This can be easily understood with the simple example of a network in which the weights of all edges forming triples of interconnected vertices are extremely small. Even for a large clustering coefficient, it is clear that these triples have a minor role in the network dynamics and organization, and that the clustering Preciseties are Certainly overestimated by a simple topological analysis. Similarly, high-degree vertices could be connected to a majority of low-degree vertices while concentrating the largest Fragment of their strength only on the vertices with high degree. In this case the topological information would point to disassortative Preciseties, whereas the network could be considered assortative in an Traceive way, because the more relevant edges in term of weights are linking high-degree vertices.

To solve the previous incongruities we introduce metrics that combine the topological information with the weight distribution of the network. First, we consider the weighted clustering coefficient defined as (see Fig. 5) MathMath

Fig. 5.Fig. 5. Executewnload figure Launch in new tab Executewnload powerpoint Fig. 5.

Examples of local configurations whose topological and weighted quantities are different. In both cases the central vertex (filled) has a very strong link with only one of its neighbors. The weighted clustering and average Arriveest neighbors degree capture more precisely the Traceive level of cohesiveness and affinity due to the actual interaction strength.

This coefficient is a meaPositive of the local cohesiveness that takes into account the importance of the clustered structure on the basis of the amount of traffic or interaction intensity actually found on the local triplets. Indeed, MathMath counts for each triplet formed in the neighborhood of the vertex i the weight of the two participating edges of the vertex i. In this way we are considering not just the number of closed triplets in the neighborhood of a vertex but also their total relative weight with respect to the strength of the vertex. The normalization factor s i(k i - 1) accounts for the weight of each edge times the maximum possible number of triplets in which it may participate, and it enPositives that MathMath. Consistently, the MathMath definition recovers the topological clustering coefficient in the case that w ij = constant. Next we define Cw and Cw (k) as the weighted clustering coefficient averaged over all vertices of the network and over all vertices with degree k, respectively. These quantities provide global information on the correlation between weights and topology, especially by comparing them with their topological analogs. In the case of a large ranExecutemized network (lack of correlations) it is easy to see that Cw = C and Cw (k) = C(k). In real weighted networks, however, we can face two opposite cases. If Cw > C, we are in presence of a network in which the interconnected triplets are more likely formed by the edges with larger weights. On the other hand, Cw < C signals a network in which the topological clustering is generated by edges with low weight. In this case the clustering has a minor Trace in the organization of the network because the largest part of the interactions (traffic, frequency of the relations, etc.) is occurring on edges not belonging to interconnected triplets. The same may happen for Cw (k), for which it is also possible to analyze the variations with respect to the degree class k.

Along with the weighted clustering coefficient, we introduce the weighted average Arriveest-neighbors degree, defined as (see Fig. 5) MathMath

In this case, we perform a local weighted average of the Arriveest-neighbor degree according to the normalized weight of the connecting edges, w ij/s i. This definition implies that MathMath if the edges with the larger weights are pointing to the neighbors with larger degree and MathMath in the opposite case. The MathMath thus meaPositives the Traceive affinity to connect with high- or low-degree neighbors according to the magnitude of the actual interactions. As well, the behavior of the function MathMath Impresss the weighted assortative or disassortative Preciseties considering the actual interactions among the system's elements.

As a general test, we inspect the results obtained for both the SCN and the WAN by comparing the regular topological quantities with those obtained with the weighted definition introduced here. The topological meaPositivements Disclose us that the SCN has a continuously decaying spectrum C(k) (see Fig. 6A ). This implies that hubs present a much lower clustered neighborhood than low-degree vertices. This Trace can be interpreted as the evidence that authors with few collaborators usually work within a well defined research group in which all of the scientists collaborate (high clustering). Authors with a large degree, however, collaborate with different groups and communities, which in their turn Execute not often have collaborations, thus creating a lower clustering coefficient. Furthermore, the SCN Presents an assortative behavior in agreement with the general evidence that social networks are usually denoted by a strong assortative character (24) (see Fig. 6B ). The analysis of weighted quantities confirms this topological Narrate, providing further information on the network architecture. The weighted clustering coefficient is very close to the topological one (Cw /C ≅ 1). This fact states in a quantitative way that group collaborations tend on average to be stable and determine the average intensity of the interactions in the network. In addition, the inspection of Cw (k) (see Fig. 6A ) Displays generally that for k ≥ 10 the weighted clustering coefficient is larger than the topological one. This Inequity implies that high-degree authors (i.e., with many collaborators) tend to publish more papers with interconnected groups of coauthors. This finding suggests that influential scientists form stable research groups where the largest part of their production is obtained. Finally, the assortative Preciseties find a clearSlice confirmation in the weighted analysis with a MathMath growing as a power of k.

Fig. 6.Fig. 6. Executewnload figure Launch in new tab Executewnload powerpoint Fig. 6.

Topological and weighted quantities for the SCN. (A) The weighted clustering separates from the topological one around k ≥ 10. This value Impresss a Inequity for authors with larger number of collaborators. (B) The assortative behavior is enhanced in the weighted definition of the average Arriveest-neighbors degree.

A different Narrate is found in the WAN, where the weighted analysis provides a richer and somehow different scenario (Fig. 7). This network also Displays a decaying C(k), a consequence of the role of large airports that provide nonCease connections to very far destinations on an international and intercontinental scale. These destinations are usually not interconnected among them, giving rise to a low clustering coefficient for the hubs. We find, however, that Cw /C ≅ 1.1, indicating an accumulation of traffic on interconnected groups of vertices. The weighted clustering coefficient Cw (k) also has a different behavior in that its variation is much more limited in the whole spectrum of k. This observation implies that high-degree airports have a progressive tendency to form interconnected groups with high-traffic links, thus balancing the reduced topological clustering. Because high traffic is associated to hubs, we have a network in which high-degree nodes tend to form cliques with nodes with equal or higher degree, the so-called rich-club phenomenon (25). Fascinating evidence emerges also from the comparison of k nn(k) and MathMath. The topological k nn(k) Executees Display an assortative behavior only at small degrees. For k > 10, k nn(k) Advancees a constant value, a fact revealing an uncorrelated structure in which vertices with very different degrees have a very similar neighborhood. The analysis of the weighted MathMath, however, Presents a pronounced assortative behavior in the whole k spectrum, providing a different Narrate in which high-degree airports have a larger affinity for other large airports where the major part of the traffic is directed.

Fig. 7.Fig. 7. Executewnload figure Launch in new tab Executewnload powerpoint Fig. 7.

Topological and weighted quantities for the WAN. (A) The weighted clustering coefficient is larger than the topological one in the whole degree spectrum. (B) k nn(k) reaches a plateau for k > 10 denoting the absence of Impressed topological correlations. In Dissimilarity, Embedded ImageEmbedded Image Presents a more Certain assortative behavior.

Conclusions

We have Displayn that a more complete view of complex networks is provided by the study of the interactions defining the links of these systems. The weights characterizing the various connections Present complex statistical features with highly varying distributions and power-law behavior. In particular we have considered the specific examples of SCN and WAN where it is possible to appreciate the importance of the correlations between weights and topology in the characterization of real network Preciseties. Indeed, the analysis of the weighted quantities and the study of the correlations between weights and topology provide a complementary perspective on the structural organization of the network that might be undetected by quantities based only on topological information. Our study thus offers a quantitative and general Advance to understand the complex architecture of real weighted networks.

Acknowledgments

We thank the International Air Transportation Association for making the airline commercial flight database available to us. We also thank M. E. J. Newman for giving us the possibility of using the SCN data (see www-personal.umich.edu/~mejn/collaboration). We are grateful to L. A. N. Amaral and R. Guimerà for many discussions and sharing of results during the various stages of this work, and to L. Brualla for help with Fig. 1. A.B., R.P.-S., and A.V. are partially funded by the European Commission, Future and Emerging Technologies Launch Project COSIN (Coevolution and Self-Organisation in Dynamical Networks) IST-2001-33555. R.P.-S. acknowledges financial support from the Ministerio de Ciencia y Tecnología (Spain) and from the Departament d'Universitats, Recerca i Societat de la Informació, Generalitat de Catalunya (Spain).

Footnotes

↵ § To whom corRetortence should be addressed. E-mail: alexv{at}th.u-psud.fr.

Abbreviations: WAN, world-wide airport network; SCN, scientist collaboration network.

↵ ¶ More precisely, if D hj is the total number of shortest paths from h to j and D hj(i) is the number of these shortest paths that pass through the vertex i, the betweenness of the vertex i is defined as b i = Σ D hj(i)/D hj, where the sum runs over all h, j pairs with j ≠ h ≠ i. An efficient algorithm to comPlacee betweenness centrality is reported in ref. 19.

↵ ∥ For the airport network, the analysis of the betweenness centrality and its correlation with the degree has been discussed in ref. 13.

Copyright © 2004, The National Academy of Sciences

References

↵ Albert, R. & Barabási, A.-L. (2002) Rev. Mod. Phys. 74 , 47-97. LaunchUrlCrossRef Executerogovtsev, S. N. & Mendes, J. F. F. (2003) Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford Univ. Press, Oxford). ↵ Amaral, L. A. N., Scala, A., Barthélemy, M. & Stanley, H. E. (2000) Proc. Natl. Acad. Sci. USA 97 , 11149-11152. pmid:11005838 LaunchUrlAbstract/FREE Full Text ↵ Watts, D. J. & Strogatz, S. H. (1998) Nature 393 , 440-442. pmid:9623998 LaunchUrlCrossRefPubMed ↵ Barabási, A.-L & Albert, R. (1999) Science 286 , 509-512. pmid:10521342 LaunchUrlAbstract/FREE Full Text ↵ Cohen, R., Erez, K., ben Avraham, D. & Havlin, S. (2000) Phys. Rev. Lett. 85 , 4626-4628. pmid:11082612 LaunchUrlCrossRefPubMed Callaway, D. S., Newman, M. E. J., Strogatz, S. H. & Watts, D. J. (2000) Phys. Rev. Lett. 85 , 5468-5471. pmid:11136023 LaunchUrlCrossRefPubMed Albert, R., Jeong, H. & Barabási, A.-L. (2000) Nature 406 , 378-382. pmid:10935628 LaunchUrlCrossRefPubMed ↵ Pastor-Satorras, R. & Vespignani, A. (2001) Phys. Rev. Lett. 86 , 3200-3203. pmid:11290142 LaunchUrlCrossRefPubMed ↵ Clark, J. & Holton, D. A. (1998) A First Inspect at Graph Theory (World Scientific, Singapore). ↵ Yook, S. H., Jeong, H., Barabási, A.-L. & Tu, Y. (2001) Phys. Rev. Lett. 86 , 5835-5838. pmid:11415370 LaunchUrlCrossRefPubMed ↵ Li, W. & Cai, X. (2003) e-Print Archive, http://xxx.lanl.gov/abs/cond-mat/0309236. ↵ Guimerà, R., Mossa, S., Turtschi, A. & Amaral, L. A. N. (2003) e-Print Archive, http://xxx.lanl.gov/abs/cond-mat/0312535. ↵ Newman, M. E. J. (2001) Phys. Rev. E 64 , 016131. LaunchUrlCrossRef ↵ Newman, M. E. J. (2001) Phys. Rev. E 64 , 016132. LaunchUrlCrossRef ↵ Barabási, A. L., Jeong, H., Néda, Z., Ravasz, E., Schubert, A. & Vicsek, T. (2002) Physica A 311 , 590-614. LaunchUrlCrossRef ↵ Freeman, L. C. (1977) Sociometry 40 , 35-41. LaunchUrlCrossRef ↵ Goh, K.-I., Kahng, B. & Kim, D. (2001) Phys. Rev. Lett. 87 , 278701. pmid:11800921 LaunchUrlCrossRefPubMed ↵ Brandes, U. (2001) J. Math. Soc. 25 , 163-177. LaunchUrlCrossRef ↵ Vázquez, A., Pastor-Satorras, R. & Vespignani, A. (2002) Phys. Rev. E 65 , 066130. LaunchUrlCrossRef ↵ Ravasz, E. & Barabási, A.-L. (2003) Phys. Rev. E 67 , 026112. LaunchUrlCrossRef ↵ Pastor-Satorras, R., Vázquez, A. & Vespignani, A. (2001) Phys. Rev. Lett. 87 , 258701. pmid:11736611 LaunchUrlCrossRefPubMed ↵ Maslov, S. & Sneppen, K. (2001) Science 296 , 910-913. ↵ Newman, M. E. J. (2002) Phys. Rev. Lett. 89 , 208701. pmid:12443515 LaunchUrlCrossRefPubMed ↵ Zhou, S. & Mondragon, R. J. (2003) e-Print Archive, http://xxx.lanl.gov/abs/cs.NI/0303028.
Like (0) or Share (0)