3.8 Article

A clustering coefficient for complete weighted networks

Journal

NETWORK SCIENCE
Volume 3, Issue 2, Pages 183-195

Publisher

CAMBRIDGE UNIV PRESS
DOI: 10.1017/nws.2014.26

Keywords

binary network; clustering coefficient; complete network; directed network; undirected network; weighted network

Ask authors/readers for more resources

The clustering coefficient is typically used as a measure of the prevalence of node clusters in a network. Various definitions for this measure have been proposed for the cases of networks having weighted edges which may or not be directed. However, these techniques consistently assume that only a subset of all possible edges is present in the network, whereas there are weighted networks of interest in which all possible edges are present, that is, complete weighted networks. For this situation, the concept of clustering is redefined, and computational techniques are presented for computing an associated clustering coefficient for complete weighted undirected or directed networks. The performance of this new definition is compared with that of current clustering definitions when extended to complete weighted networks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available