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

几何无标度随机图中的最优子图

Optimal subgraphs in geometric scale-free random graphs

Riccardo Michielan, Clara Stegehuis, Matthias Walter

AI总结:

本文研究几何无标度随机图的最优子图计数,采用分而治之策略分析特定顶点类中的子图数量并确定最大贡献类,揭示了子图缩放行为与混合整数线性规划解的关联,并推导了树和哈密顿子图的精确渐近性。

摘要:

几何无标度随机图是常用于展现重尾度分布、小世界性和高聚类性的网络模型。在这些模型中,顶点具有导致重尾度的权重,并被嵌入度量空间中,使得相近的顶点群倾向于聚类。顶点权重与位置之间的相互作用极大地影响随机图的局部结构,尤其是子图模式的出现,但这些结构和权重中的依赖关系使其难以分析。在本文中,我们使用分而治之策略研究子图计数:首先计算特定顶点类中的子图数量;然后计算哪一类产生最大贡献。有趣的是,此类几何重尾随机图中导出子图和一般子图的缩放行为与混合整数线性规划的解密切相关,这也表明子图主要出现在具有某些规定度和相互距离的顶点上。最后,我们推导出了树和哈密顿子图的精确渐近性。

英文摘要:

Geometric scale-free random graphs are popular models for networks that exhibit as heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices have weights that cause the heavy-tailed degrees and are embedded in a metric space so that close-by groups of vertices tend to cluster. The interplay between the vertex weights and positions heavily affects the local structure of the random graph, in particular the occurrence of subgraph patterns, but the dependencies in these structures and weights make them difficult to analyze. In this paper we investigate subgraph counts using a \textit{divide et impera} strategy: first counting the number of subgraphs in specific classes of vertices; then computing which class yields maximum contribution. Interestingly, the scaling behavior of induced and general subgraphs in such geometric heavy-tailed random graphs is closely related to the solution of a mixed-integer linear program which also shows that subgraphs appear predominantly on vertices with some prescribed degrees and inter-distances. Finally, we derive precise asymptotics for trees and Hamiltonian subgraphs.

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

↑