A clustering coefficient for complete weighted networks. (9th January 2015)

• Record Type: Journal Article
• Authors: MCASSEY, MICHAEL P.; BIJMA, FETSJE
• Is Part Of: Network science. Volume 3:Number 2(2015)
• Page Start: 183
• Page End: 195
• Publication Date: 2015-01-09
• Subjects: Social networks -- Research -- Periodicals; System analysis -- Periodicals; System theory -- Periodicals; Computer science -- Periodicals; 003.72
• DOI: 10.1017/nws.2014.26
• Languages: English
• ISSNs: 2050-1242

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>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.</p> </abstract>