arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.04669physics.soc-phcond-mat.dis-nn
收藏

通过三元闭包实现强聚类随机图:度相关性和聚类谱

Strongly clustered random graphs via triadic closure: Degree correlations and clustering spectrum

Dipartimento di Fisica Università La Sapienza(罗马大学物理系);University of Aveiro(阿威罗大学);University of Leeds(利兹大学)

Lorenzo Cirigliano, Gareth J. Baxter, Gábor Timár

AI总结:

本文提出一种通过随机网络骨架中每个三元组以一定概率闭合来生成强聚类随机图的模型,并精确推导了局部聚类谱和度相关性的表达式,揭示了高度传递性与正度同配性及聚类谱的非平凡结构。

摘要:

现实世界网络通常表现出强传递性,并具有非平凡的局部聚类谱和度相关性。这些特征在易处理的网络模型中难以建模,给理解此类复杂网络结构造成了障碍。本文通过一种强聚类随机图模型来解决这个问题,其中随机网络骨架的每个三元组以一定概率闭合。尽管所得图具有复杂的环状局部结构,我们仍为局部聚类谱和度相关性提供了精确表达式,填补了该随机图模型理论描述中的空白。特别地,我们发现高度传递性伴随着正度同配性,以及聚类谱中的非平凡结构。对于无关联的局部树状骨架,我们得到了精确的渐近解析结果,并辅以对有限尺寸效应的广泛数值表征。

英文摘要:

Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding of such complex network structures. Here, we address this problem using a model for strongly clustered random graphs in which each triad of a random network backbone is closed with a certain probability. Despite the intricate loopy local structure of the graphs obtained, we provide exact expressions for the local clustering spectrum and the degree correlations, filling the gap in the theoretical description of this model for random graphs. In particular, we find positive degree assortativity accompanying high transitivity, and nontrivial structure in the clustering spectrum. Exact asymptotic analytical results, obtained for uncorrelated locally tree-like backbones, are complemented with extensive numerical characterization of finite-size effects.

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

↑