Generalizations of the clustering coefficient to weighted complex networks

Jari Saramäki, Mikko Kivelä, Jukka-Pekka Onnela, Kimmo Kaski, and János Kertész
Phys. Rev. E 75, 027105 – Published 23 February 2007

Abstract

The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduced in the literature, and point out their advantages and limitations. The concepts are illustrated by simple examples as well as by empirical data of the world trade and weighted coauthorship networks.

  • Figure
  • Figure
  • Figure
  • Received 31 August 2006

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

©2007 American Physical Society

Authors & Affiliations

Jari Saramäki1,*, Mikko Kivelä1, Jukka-Pekka Onnela1,2, Kimmo Kaski1, and János Kertész1,3

  • 1Laboratory of Computational Engineering, Helsinki University of Technology, P.O. Box 9203, FIN-02015 HUT, Finland
  • 2Department of Physics, Clarendon Laboratory, University of Oxford, Oxford, OX1 3PU, United Kingdom
  • 3Department of Theoretical Physics, Budapest University of Technology and Economics, Budapest, Hungary

  • *Electronic address: jsaramak@lce.hut.fi

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 75, Iss. 2 — February 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
×