Recognition: unknown
Generalizations of the clustering coefficient to weighted complex networks
classification
❄️ cond-mat.stat-mech
cond-mat.dis-nnphysics.soc-ph
keywords
complexnetworksweightedclusteringcoefficientgeneralizationsaccountadvantages
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.