arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.00862stat.MEcs.SImath.STstat.APstat.TH
收藏

基于小子图统计量的全局网络结构测试

Testing for Global Network Structure Using Small Subgraph Statistics

Chao Gao, John Lafferty

摘要:

我们研究的问题,测试社区结构的网络中使用的关系,观察到的频率的小子图。我们提出了一个简单的测试社区存在的基础上,只有三个节点的子图的频率。检验统计量被证明是渐近正态的零假设下,没有社区结构,并有权力接近一个复合备择假设下的度校正随机块模型。我们还推导出一个版本的测试,适用于多元高斯数据。我们的方法实现了接近最佳的检测率的存在下的社区结构,在政权的信噪比太弱,明确估计社区本身,使用现有的计算效率高的算法。我们演示了该方法如何有效地检测社交网络中的结构,科学文章的引用网络,以及标准普尔500指数公司之间的股票收益率的相关性。

英文摘要:

We study the problem of testing for community structure in networks using relations between the observed frequencies of small subgraphs. We propose a simple test for the existence of communities based only on the frequencies of three-node subgraphs. The test statistic is shown to be asymptotically normal under a null assumption of no community structure, and to have power approaching one under a composite alternative hypothesis of a degree-corrected stochastic block model. We also derive a version of the test that applies to multivariate Gaussian data. Our approach achieves near-optimal detection rates for the presence of community structure, in regimes where the signal-to-noise is too weak to explicitly estimate the communities themselves, using existing computationally efficient algorithms. We demonstrate how the method can be effective for detecting structure in social networks, citation networks for scientific articles, and correlations of stock returns between companies on the S\&P 500.

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

↑