集聚系数
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
- Subclass of
- graph property
Show 3 more facts
- Commons category
- Clustering coefficient
- studied by
- graph theory
- described at URL
- konect.cc/statistics/clusco
Sources (2)
via Wikidata · CC0
Article · 中文
在图论中，集聚系数（也称群聚系数、集群系数）是用来描述一个图中的顶点之间结集成团的程度的系数。具体来说，是一个点的邻接点之间相互连接的程度。例如生活社交网络中，你的朋友之间相互认识的程度。有证据表明，在各类反映真实世界的网络结构，特别是社交网络结构中，各个结点之间倾向于形成密度相对较高的网群。也就是说，相对于在两个节点之间随机连接而得到的网络，真实世界网络的集聚系数更高。 集聚系数分为整体与局部两种。整体集聚系数可以给出一个图中整体的集聚程度的评估，而局部集聚系数则可以测量图中每一个结点附近的集聚程度。
Abstract from DBpedia / Wikipedia · CC BY-SA