Graph 如何求图的全局聚类系数?

Graph 如何求图的全局聚类系数?,graph,graph-theory,social-networking,web-analytics,Graph,Graph Theory,Social Networking,Web Analytics,我从上周开始学习网络分析及其度量计算。没有足够的知识。有人能查一下吗 求全局聚类系数的公式是 C = (3 * Number of Triangles) / (Number of connected triples of vertices) 我将全局聚类系数计算为 Number of Triangles = 2 (as there are 2 directly connected triangles in the graph i-e Node4->Node5->Node6 and

我从上周开始学习网络分析及其度量计算。没有足够的知识。有人能查一下吗

求全局聚类系数的公式是

C = (3 * Number of Triangles) / (Number of connected triples of vertices)
我将全局聚类系数计算为

Number of Triangles = 2 
(as there are 2 directly connected triangles in the graph i-e Node4->Node5->Node6 and Node1->Node3->Node4)

Number of connected triples of vertices = 4 
(as Node1, Node2, Node3 & Node6 have three vertices connected)

 C = (3 * 2) / 4 = 1.5
我不知道我做得对不对。有人能查一下吗?如果我错了就纠正我


“连接的三元组”实际上是指“由至少两条边连接的三个顶点组成的组”。例如,(1,4,6)是一个连接的三元组。@VincentLabatut谢谢。顶点1、4和6连接3条边。但是顶点2和3为什么不呢?它们也通过三条边连接。那么,(1,3,7)和(1,2,7)都是连接的三元组。