clustering coefficient
Sign in to savenumber defined from a node-link network quantifying how likely it is that two neighbors of a randomly chosen node will be adjacent
Described at
Clustering coefficient
konect.cc →These are the values of the clustering coefficient (c) for all networks to which the statistic applies and for which it was computed. In total, it has been computed for 427 networks. The clustering coefficient (c) equals the probability that a random chosen wedge (i.e., 2-star) is completed by a third edge to form a triangle. Multiple edges, edge directions and loops are not taken into account.
Excerpt from a page describing this subject · 40,000 chars · not written by Vinony
Wikidata facts
Show 2 more facts
- Commons category
- Clustering coefficient
- described at URL
- konect.cc/statistics/clusco
Sources (2)
via Wikidata · CC0
Connections
Duncan J. Watts
Entity
International Standard Book Number
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
graph theory
Entity
Nature
Entity
Q180686
Entity
social network
Entity
graph
Entity
bibcode
Entity
Q118398
Entity
Q229883
Entity
tree
Entity
complete graph
Entity
Q22908627
Entity
node
Entity
adjacency matrix
Entity
directed graph
Entity
bipartite graph
Entity
nota bene
Entity