arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.04856stat.MEmath.PRmath.STstat.TH
收藏

加权符号网络中模块度的渐近分布

The Asymptotic Distribution of Modularity in Weighted Signed Networks

Rong Ma, Ian Barnett

摘要:

模块性是一个流行的度量标准,用于量化网络中社区结构的程度。网络的边权重或邻接矩阵的最大特征值的分布被很好地研究,并且在执行统计推断时经常被用作模块性的替代。然而,我们发现,最大的特征值和模块性是渐近不相关的,这表明需要直接对模块性本身的推理时,网络规模很大。为此,我们推导了网络的边权矩阵属于高斯正交包络的情况下,模块度的渐近分布,并研究了相应的测试社区结构在一些替代模型下的统计功效。我们经验性地探索极限分布的普遍性扩展,并通过第一类错误模拟来证明这些渐近分布的准确性。我们还比较了一些现有的方法的经验权力的模块化为基础的测试。然后,我们的方法被用来测试社区结构的存在下,在两个真实的数据应用程序。

英文摘要:

Modularity is a popular metric for quantifying the degree of community structure within a network. The distribution of the largest eigenvalue of a network's edge weight or adjacency matrix is well studied and is frequently used as a substitute for modularity when performing statistical inference. However, we show that the largest eigenvalue and modularity are asymptotically uncorrelated, which suggests the need for inference directly on modularity itself when the network size is large. To this end, we derive the asymptotic distributions of modularity in the case where the network's edge weight matrix belongs to the Gaussian Orthogonal Ensemble, and study the statistical power of the corresponding test for community structure under some alternative model. We empirically explore universality extensions of the limiting distribution and demonstrate the accuracy of these asymptotic distributions through type I error simulations. We also compare the empirical powers of the modularity based tests with some existing methods. Our method is then used to test for the presence of community structure in two real data applications.

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

↑