arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.01875math.PR
收藏

几何非齐次随机图中的团

Cliques in geometric inhomogeneous random graph

Riccardo Michielan, Clara Stegehuis

摘要:

许多现实世界的网络被发现是高度聚集的,并且包含大量的小集团。我们在这里调查团的数量包含在一个几何不均匀的随机图:一个无标度网络模型包含几何的任何大小k。无尺度性和几何体之间的相互作用确保了连接可能在高度数顶点之间形成,或者在邻近的顶点之间形成。同时,很少有顶点具有高度数,并且大多数顶点彼此不接近。这种权衡使集团更有可能出现在特定顶点之间。在本文中,我们形式化这种权衡,并证明存在一个典型类型的集团的程度和跨越集团的顶点的位置。此外,我们表明,集团的渐近数以及典型的集团类型经历了相变,其中只有k和度指数τ。有趣的是,这种相变表明,对于小的tau值,模型的基本几何结构是无关紧要的:集团的数量与非几何网络中的规模相同

英文摘要:

Many real-world networks were found to be highly clustered, and contain a large amount of small cliques. We here investigate the number of cliques of any size k contained in a geometric inhomogeneous random graph: a scale-free network model containing geometry. The interplay between scale-freeness and geometry ensures that connections are likely to form between either high-degree vertices, or between close by vertices. At the same time it is rare for a vertex to have a high degree, and most vertices are not close to one another. This trade-off makes cliques more likely to appear between specific vertices. In this paper, we formalize this trade-off and prove that there exists a typical type of clique in terms of the degrees and the positions of the vertices that span the clique. Moreover, we show that the asymptotic number of cliques as well as the typical clique type undergoes a phase transition, in which only k and the degree-exponent tau are involved. Interestingly, this phase transition shows that for small values of tau, the underlying geometry of the model is irrelevant: the number of cliques scales the same as in a non-geometric network

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

↑