双曲平面上随机图的模度
The modularity of random graphs on the hyperbolic plane
摘要:
模块性是在复杂网络的背景下引入的一个数量,以量化网络与理想模块化网络的接近程度,在理想模块化网络中,节点形成小的互连社区,这些社区通过相对较少的边缘连接在一起。在本文中,我们考虑这个数量的Krioukov等人(Phys. Rev. E 2010)介绍的复杂网络的最近的概率模型。该模型将复杂网络视为隐藏层次的表达,并由底层双曲空间封装。在一定的参数下,证明了该模型具有复杂网络中的典型特征,如幂律度分布、有界平均度、聚类系数渐近有界、超小的典型距离等.在目前的工作中,我们调查它的模块化,我们表明,在这种制度下,它收敛到1的概率。
英文摘要:
Modularity is a quantity which has been introduced in the context of complex networks in order to quantify how close a network is to an ideal modular network in which the nodes form small interconnected communities that are joined together with relatively few edges. In this paper, we consider this quantity on a recent probabilistic model of complex networks introduced by Krioukov et al. (Phys. Rev. E 2010). This model views a complex network as an expression of hidden hierarchies, encapsulated by an underlying hyperbolic space. For certain parameters, this model was proved to have typical features that are observed in complex networks such as power law degree distribution, bounded average degree, clustering coefficient that is asymptotically bounded away from zero, and ultra-small typical distances. In the present work, we investigate its modularity and we show that, in this regime, it converges to 1 in probability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。