arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.0958cs.SIphysics.soc-ph
收藏

复杂网络中传递性的建模

Modeling Transitivity in Complex Networks

Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani

摘要:

在现实世界的网络中,高聚类系数的一个重要来源是传递性。然而,现有的用于对传递性进行建模的方法遭受以下问题中的至少一个:i)它们从特定类别(如二分图)生成图,ii)它们没有给出模型的高聚类系数的分析论证,以及iii)它们的聚类系数仍然显著低于真实世界的网络。在本文中,我们提出了一个新的模型,复杂网络的基础上增加了传递性的无标度模型。我们从理论上分析了该模型,并提供了其不同属性的分析参数。特别是,我们计算的模型是独立的网络大小,在现实世界中的网络的聚类系数的下限。超过理论分析,该模型的主要属性进行了经验评估,它表明,该模型可以精确地模拟现实世界中的网络从不同的领域和不同的规格。

英文摘要:

An important source of high clustering coefficient in real-world networks is transitivity. However, existing approaches for modeling transitivity suffer from at least one of the following problems: i) they produce graphs from a specific class like bipartite graphs, ii) they do not give an analytical argument for the high clustering coefficient of the model, and iii) their clustering coefficient is still significantly lower than real-world networks. In this paper, we propose a new model for complex networks which is based on adding transitivity to scale-free models. We theoretically analyze the model and provide analytical arguments for its different properties. In particular, we calculate a lower bound on the clustering coefficient of the model which is independent of the network size, as seen in real-world networks. More than theoretical analysis, the main properties of the model are evaluated empirically and it is shown that the model can precisely simulate real-world networks from different domains with and different specifications.

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

↑