arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1311.6401physics.soc-phcs.SI
收藏

无标度随机网络中与节点数无关的可调聚类系数生成模型

A model for generating tunable clustering coefficients independent of the number of nodes in scale free and random networks

Vijay K Samalam

摘要:

概率网络显示出大范围的高平均聚类系数,与网络中的节点数量无关。特别是,局部聚类系数以任何当前模型都无法解释的复杂方式随着对向节点的程度而减小。虽然已经提出了一些假设来解释这些观察到的特性,但没有可解决的模型来解释所有这些特性。我们提出了一种新的增长模型的随机和无标度网络,能够预测两个可调的聚类系数独立的网络大小,和本地聚类系数和节点度之间的反比关系,在大多数网络中观察到。

英文摘要:

Probabilistic networks display a wide range of high average clustering coefficients independent of the number of nodes in the network. In particular, the local clustering coefficient decreases with the degree of the subtending node in a complicated manner not explained by any current models. While a number of hypotheses have been proposed to explain some of these observed properties, there are no solvable models that explain them all. We propose a novel growth model for both random and scale free networks that is capable of predicting both tunable clustering coefficients independent of the network size, and the inverse relationship between the local clustering coefficient and node degree observed in most networks.

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

↑