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

偏好附加图的模ularity

Modularity of preferential attachment graphs

Adam Mickiewicz University(亚当·密茨凯维奇大学);Wrocław University of Science and Technology(弗罗茨瓦夫科技大学)

Katarzyna Rybarczyk, Małgorzata Sulkowska

AI总结:

研究偏好附加图的模ularity,证明其在高概率下趋近于0,解决了一个猜想并扩展了相关结果。

摘要:

我们研究了偏好附加模型G_n^h。G_n^h是从有限初始图生成的,通过逐个添加新顶点来生成。每个新顶点连接到h≥1个已存在的顶点,并且这些顶点的选择概率与它们的当前度数成正比。我们特别关注G_n^h的社区结构,这用所谓的模ularity来表达。我们证明了G_n^h的模ularity在高概率下被一个趋近于0的函数上界所限制。这解决了Prokhorenkova、Pralat和Raigorodskii于2016年提出的猜想。作为副产品,我们获得了关于G_n^h顶点子集的体积和边密度参数的新集中结果(这些结果本身具有吸引力)。关键成分是定义函数μ,它作为顶点子集的自然度量,与它们体积的平均大小成比例。这扩展了Frieze、Pralat、Pérez-Giménez和Reiniger于2019年在该主题上的先前结果。

英文摘要:

We study the preferential attachment model $G_n^h$. A graph $G_n^h$ is generated from a finite initial graph by adding new vertices one at a time. Each new vertex connects to $h\ge 1$ already existing vertices, and these are chosen with probability proportional to their current degrees. We are particularly interested in the community structure of $G_n^h$, which is expressed in terms of the so-called modularity. We prove that the modularity of $G_n^h$ is with high probability upper bounded by a function that tends to $0$ as $h$ tends to infinity. This resolves the conjecture of Prokhorenkova, Pralat, and Raigorodskii from 2016. As a byproduct, we obtain novel concentration results (which are interesting in their own right) for the volume and edge density parameters of vertex subsets of $G_n^h$. The key ingredient here is the definition of the function $μ$, which serves as a natural measure for vertex subsets, and is proportional to the average size of their volumes. This extends previous results on the topic by Frieze, Pralat, Pérez-Giménez, and Reiniger from 2019.

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

↑