The architecture of complex weighted networks

  1. A. Barrat*,
  2. M. Barthélemy,
  3. R. Pastor-Satorras, and
  4. A. Vespignani*,§
  1. *Laboratoire de Physique Théorique (Unité Mixte de Recherche du Centre National de la Recherche Scientifique 8627), Bâtiment 210, Université de Paris-Sud, 91405 Orsay Cedex, France; Commissariat à l'Energie Atomique-Département de Physique Théorique et Appliquée, 91191 Bruyères-Le-Chatel, France; and Departament de Física i Enginyeria Nuclear, Universitat Politècnica de Catalunya, Campus Nord, Mòdul B4, 08034 Barcelona, Spain
  1. Communicated by Giorgio Parisi, University of Rome, Rome, Italy, January 8, 2004 (received for review October 29, 2003)

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 great 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 assign to each edge of the graph a weight proportional 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 properties 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.

Footnotes

  • § To whom correspondence 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 jhi. An efficient algorithm to compute 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.

« Previous | Next Article »Table of Contents