Clustering coefficient

Known as: Clustering 
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Clustering coefficients, also called triangle counting, is a widely-used graph analytic for measuring the closeness in which… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We establish asymptotic vertex degree distribution and examine its relation to the clustering coefficient in two popular random… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Identification of essential proteins is key to understanding the minimal requirements for cellular life and important for drug… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2011
2011
Social and other networks have been shown empirically to exhibit high edge clustering — that is, the density of local… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In recent years, researchers have investigated a growing number of weighted networks where ties are differentiated according to… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2008
2008
Many real-world networks display a natural bipartite structure. It is necessary and important to study the bipartite networks by… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2008
2008
We investigate the geometric properties of the communication graph in realistic low-power wireless networks. In particular, we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Many empirical networks display an inherent tendency to cluster, i.e., to form circles of connected nodes. This feature is… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Since its introduction in the year 1998 by Watts and Strogatz, the clustering-coefficient has become a frequently used tool for… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?