Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2007
DOI: 10.1103/physreve.75.027105
|View full text |Cite
|
Sign up to set email alerts
|

Generalizations of the clustering coefficient to weighted complex networks

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 a… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
406
0
3

Year Published

2009
2009
2020
2020

Publication Types

Select...
7
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 596 publications
(436 citation statements)
references
References 17 publications
2
406
0
3
Order By: Relevance
“…C W (B) being close the C yields to two conclusions : (1) the absence of correlation (randomized network), (2) the network is divided in two sets, one where triples are constituted by larger weights and others by smaller weights. C W (O) being significantly lower is due to the weight normalization by the global max(w) and to a broad distribution of weights in networks [27]. The percentage of species with a betweenness centrality equal to 0 differed between the binary and the weighted niche-overlap graphs (Fig.…”
Section: Resultsmentioning
confidence: 99%
“…C W (B) being close the C yields to two conclusions : (1) the absence of correlation (randomized network), (2) the network is divided in two sets, one where triples are constituted by larger weights and others by smaller weights. C W (O) being significantly lower is due to the weight normalization by the global max(w) and to a broad distribution of weights in networks [27]. The percentage of species with a betweenness centrality equal to 0 differed between the binary and the weighted niche-overlap graphs (Fig.…”
Section: Resultsmentioning
confidence: 99%
“…R. Soc. B 281: 20141195 taken into account [54]; the other is the betweenness centrality, a measure of the number of shortest paths going through an agent [55], reflecting its importance in the social network.…”
Section: Resultsmentioning
confidence: 99%
“…Various kinds of average shortest path lengths and average clustering coefficients have been proposed for weighted networks [18,19]. The measures used in this research are as follows:…”
Section: Complex Network Analysismentioning
confidence: 99%