A clustering coefficient for complete weighted networks

Michael P. McAssey and Fetsje Bijma

Network Science, 2015, vol. 3, issue 2, 183-195

Abstract: 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.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
https://www.cambridge.org/core/product/identifier/ ... type/journal_article link to article abstract page (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cup:netsci:v:3:y:2015:i:02:p:183-195_00

Access Statistics for this article

More articles in Network Science from Cambridge University Press Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK.
Bibliographic data for series maintained by Kirk Stebbing ().