arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.04747cs.SIphysics.soc-ph
收藏

利用任意零模型检测网络低维结构的谱估计

Spectral estimation for detecting low-dimensional structure in networks using arbitrary null models

Mark D. Humphries, Javier A. Caballero, Mat Evans, Silvia Maggi, Abhinav Singh

摘要:

在现实世界的网络中发现低维结构需要一个合适的空模型来定义有意义的结构的缺失。在这里,我们介绍了一种谱方法,用于检测网络的低维结构,以及参与其中的节点,使用任何空模型。我们使用生成模型来估计在指定的空模型下的期望特征值分布,然后检测数据网络的特征谱超过估计界限的地方。在合成网络上,这种谱估计方法干净地检测随机和社区结构之间的转换,恢复社区的数量和成员资格,并去除噪声节点。在真实网络上,谱估计发现噪声节点的显著部分或不偏离零模型,与传统的社区发现方法形成鲜明对比。在所有的分析中,我们发现零模型的选择可以强烈地改变关于网络结构存在的结论。因此,我们的谱估计方法是一个很有前途的基础,在现实世界的网络中检测低维结构,或缺乏。

英文摘要:

Discovering low-dimensional structure in real-world networks requires a suitable null model that defines the absence of meaningful structure. Here we introduce a spectral approach for detecting a network's low-dimensional structure, and the nodes that participate in it, using any null model. We use generative models to estimate the expected eigenvalue distribution under a specified null model, and then detect where the data network's eigenspectra exceed the estimated bounds. On synthetic networks, this spectral estimation approach cleanly detects transitions between random and community structure, recovers the number and membership of communities, and removes noise nodes. On real networks spectral estimation finds either a significant fraction of noise nodes or no departure from a null model, in stark contrast to traditional community detection methods. Across all analyses, we find the choice of null model can strongly alter conclusions about the presence of network structure. Our spectral estimation approach is therefore a promising basis for detecting low-dimensional structure in real-world networks, or lack thereof.

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

↑