图子的模块化最大化
Modularity maximisation for graphons
摘要:
网络是研究复杂系统中大规模连通性结构的一种广泛使用的工具,图子被认为是稠密网络的无限大极限。社区或其他中尺度结构的检测是网络科学中的一个突出主题,因为它允许识别复杂系统中的功能构建块。这种构建块何时可能存在于石墨子中是一个悬而未决的问题。在本文中,我们定义了一个graphon模块,并证明它可以最大化,以检测社区的graphons。然后,我们研究了特定的合成石墨子,并表明它们可能显示出广泛的不同的社区结构。我们还将图子模块化最大化重新表述为一个连续优化问题,从而证明了某些图子的最佳社区结构或缺乏最佳社区结构,这对于网络来说通常是不可能的。此外,我们证明,估计一个graphon从网络数据作为一个中间步骤,可以提高社区的检测相比,完全最大化的网络的模块化。虽然图子估计的选择可能会强烈影响网络的社区结构和它的估计图子之间的一致性,我们发现,如果使用适当的估计有很大的重叠。我们的研究表明,对graphons的社区检测是可能的,并且可以作为一种隐私保护的方式来聚类网络数据。
英文摘要:
Networks are a widely-used tool to investigate the large-scale connectivity structure in complex systems and graphons have been proposed as an infinite size limit of dense networks. The detection of communities or other meso-scale structures is a prominent topic in network science as it allows the identification of functional building blocks in complex systems. When such building blocks may be present in graphons is an open question. In this paper, we define a graphon-modularity and demonstrate that it can be maximised to detect communities in graphons. We then investigate specific synthetic graphons and show that they may show a wide range of different community structures. We also reformulate the graphon-modularity maximisation as a continuous optimisation problem and so prove the optimal community structure or lack thereof for some graphons, something that is usually not possible for networks. Furthermore, we demonstrate that estimating a graphon from network data as an intermediate step can improve the detection of communities, in comparison with exclusively maximising the modularity of the network. While the choice of graphon-estimator may strongly influence the accord between the community structure of a network and its estimated graphon, we find that there is a substantial overlap if an appropriate estimator is used. Our study demonstrates that community detection for graphons is possible and may serve as a privacy-preserving way to cluster network data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。