Ensemble approach to the analysis of weighted networks

S. E. Ahnert, D. Garlaschelli, T. M. A. Fink, and G. Caldarelli
Phys. Rev. E 76, 016101 – Published 2 July 2007

Abstract

We present an approach to the analysis of weighted networks, by providing a straightforward generalization of any network measure defined on unweighted networks, such as the average degree of the nearest neighbors, the clustering coefficient, the “betweenness,” the distance between two nodes, and the diameter of a network. All these measures are well established for unweighted networks but have hitherto proven difficult to define for weighted networks. Our approach is based on the translation of a weighted network into an ensemble of edges. Further introducing this approach we demonstrate its advantages by applying the clustering coefficient constructed in this way to two real-world weighted networks.

  • Figure
  • Figure
  • Received 17 April 2006

DOI:https://doi.org/10.1103/PhysRevE.76.016101

©2007 American Physical Society

Authors & Affiliations

S. E. Ahnert1, D. Garlaschelli2, T. M. A. Fink3, and G. Caldarelli4,5

  • 1Institut Curie, CNRS UMR 144, 26 rue d’Ulm, 75248 Paris, France
  • 2Dipartimento di Fisica, Universitá di Siena, Via Roma 56, 53100 Siena, Italy
  • 3Systems Biology and CNRS UMR 144, Institut Curie, 26 rue d'Ulm, 75248 Paris, France
  • 4INFM-CNR Istituto dei Sistemi Complessi and Dipartimento di Fisica, Universitá di Roma “La Sapienza” Piazzale Moro 2, 00185 Roma, Italy
  • 5Centro Studi e Museo della Fisica Enrico Fermi, Compendio Viminale, 00185 Roma, Italy

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 76, Iss. 1 — July 2007

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×