更改

网络科学 (查看源代码)

2020年5月10日 (日) 16:27的版本

删除235字节、 2020年5月10日 (日) 16:27

第164行：第164行：

===聚集系数===

−

The clustering coefficient is a measure of an "all-my-friends-know-each-other" property. This is sometimes described as the friends of my friends are my friends. More precisely, the clustering coefficient of a node is the ratio of existing links connecting a node's neighbors to each other to the maximum possible number of such links. The clustering coefficient for the entire network is the average of the clustering coefficients of all the nodes. A high clustering coefficient for a network is another indication of a [[~~Small-world experiment~~|~~small world~~]].

+

聚集系数是表征“我所有的朋友都互相认识”这样一种性质的指标。有的时候表述为“我朋友的朋友也是我的朋友”。更准确地说，节点的聚类系数是该节点的相邻节点之间的现有连接数与其最大可能连接数之比。整个网络的聚集系数是所有节点的聚集系数的平均值。网络的高聚集系数是[[小世界实验|小世界]]的另一个指标。

−

~~The clustering coefficient of the~~ <math>i</math>~~'th node is~~

+

节点<math>i</math>的聚集系数为

:<math>C_i = {2e_i\over k_i{(k_i - 1)}}\,,</math>

−

~~where~~ <math>k_i</math> ~~is the number of neighbours of the~~ <math>i</math>~~'th node, and~~ <math>e_i</math> ~~is the number of connections between these neighbours. The maximum possible number of connections between neighbors is, then,~~

+

其中 <math>k_i</math> 是节点 <math>i</math> 的相邻节点数， <math>e_i</math> 是这些相邻节点数之间的连接数。相邻接点见最大可能的连接数为

:<math>{\binom {k}{2}} = {{k(k-1)}\over 2}\,.</math>

−

~~From a probabalistic standpoint, the expected local clustering coefficient is the likelihood of a link existing between two arbitrary neighbors of the same node.~~

+

从概率的角度来看，局部聚集系数的期望是同一节点的任意两个相邻节点之间存在连接的可能性。

=== Connectedness ===

Jxzhou

320

个编辑