arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.01480cs.SIcs.LGmath.CO
收藏

具有社团结构的ABCD随机图模型的模块性

Modularity of the ABCD Random Graph Model with Community Structure

SGH Warsaw School of Economics(华沙经济学院);Ryerson University(瑞尔森大学);Tutte Institute for Mathematics and Computing(塔特数学与计算研究所)

Bogumil Kaminski, Bartosz Pankratz, Pawel Pralat, Francois Theberge

摘要:

人工社区发现基准图(ABCD)是一个具有社区结构的随机图模型,其度和社区大小均服从幂律分布。该模型生成的图形具有与著名的LFR图形相似的特性,并且其主要参数$ξ$可以被调整以模仿LFR模型中的对应物,即混合参数$μ$。本文研究了ABCD模型的各种理论渐近性质。特别是,我们分析的模块化功能,可以说,最重要的图形属性的网络中的背景下,社区发现。事实上,模块度函数经常被用来衡量网络中社区结构的存在。它也被用作许多社区发现算法中的质量函数,包括广泛使用的Louvain算法。

英文摘要:

The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar properties as the well-known LFR one, and its main parameter $ξ$ can be tuned to mimic its counterpart in the LFR model, the mixing parameter $μ$. In this paper, we investigate various theoretical asymptotic properties of the ABCD model. In particular, we analyze the modularity function, arguably, the most important graph property of networks in the context of community detection. Indeed, the modularity function is often used to measure the presence of community structure in networks. It is also used as a quality function in many community detection algorithms, including the widely used Louvain algorithm.

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

↑