返回
Estimating Mixed Memberships With Sharp Eigenvector Deviations
DOI:10.1080/01621459.2020.1751645.png)
摘要
En 中文
We consider the problem of estimating community memberships of nodes in a network, where every node is associated with a vector determining its degree of membership in each community. Existing provably consistent algorithms often require strong assumptions about the population, are computationally expensive, and only provide an overall error bound for the whole community membership matrix. This article provides uniform rates of convergence for the inferred community membership vector ofeachnode in a network generated from the mixed membership stochastic blockmodel (MMSB); to our knowledge, this is the first work to establish per-node rates for overlapping community detection in networks. We achieve this by establishing sharp row-wise eigenvector deviation bounds for MMSB. Based on the simplex structure inherent in the eigen-decomposition of the population matrix, we build on established corner-finding algorithms from the optimization community to infer the community membership vectors. Our results hold over a broad parameter regime where the average degree only grows poly-logarithmically with the number of nodes. Using experiments with simulated and real datasets, we show that our method achieves better error with lower variability over competing methods, and processes real world networks of up to 100,000 nodes within tens of seconds.for this article are available online.
Keyword:
Asymptotic analysis
Clustering
Networks
Overlapping community detection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
THE TWO-TO-INFINITY NORM AND SINGULAR SUBSPACE GEOMETRY WITH APPLICATIONS TO HIGH-DIMENSIONAL STATISTICS二到无穷范数和奇异子空间几何及其在高维统计中的应用
ANNALS OF STATISTICS
IF3.7
Coupling energy metabolism with a mechanism to support brain-derived neurotrophic factor-mediated synaptic plasticity
Neuroscience
IF0

