arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.02999physics.soc-phcs.NIcs.SI
收藏

复杂网络中的聚类系数

On Clustering Coefficients in Complex Networks

Alexander I Nesterov

AI总结:

本文指出全局聚类系数的两种常见计算方法(局部平均值法与三元组比率法)存在强烈不等价性,这种差异会显著影响复杂网络结构分析的准确性。

摘要:

聚类系数是理解复杂网络结构的有价值工具。它被广泛用于分析社交网络、生物网络和其他复杂系统。虽然局部聚类系数通常有单一通用定义,但全局聚类系数有两种不同的计算方法。第一种方法取网络中每个节点局部聚类系数的平均值。第二种基于闭合三元组与所有三元组的比率。研究表明,全局聚类系数的这两种定义强烈不等价,并可能显著影响结果的准确性。

英文摘要:

The clustering coefficient is a valuable tool for understanding the structure of complex networks. It is widely used to analyze social networks, biological networks, and other complex systems. While there is generally a single common definition for the local clustering coefficient, there are two different ways to calculate the global clustering coefficient. The first approach takes the average of the local clustering coefficients for each node in the network. The second one is based on the ratio of closed triplets to all triplets. It is shown that these two definitions of the global clustering coefficients are strongly inequivalent and may significantly impact the accuracy of the outcome.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑