Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration

To date, social network analysis has been largely focused on pairwise interactions. The study of higher-order interactions, via a hypergraph network, brings in new insights. We study community detection in a hypergraph network. A popular approach is to project the hypergraph to a graph and then apply community detection methods for graph networks, but we show that this approach may cause unwanted information loss. We propose a new method for community detection that operates directly on the hypergraph. At the heart of our method is a regularized higher-order orthogonal iteration (reg-HOOI) algorithm that computes an approximate low-rank decomposition of the network adjacency tensor. Compared with existing tensor decomposition methods such as HOSVD and vanilla HOOI, reg-HOOI yields better performance, especially when the hypergraph is sparse. Given the output of tensor decomposition, we then generalize the community detection method SCORE (Jin, 2015) from graph networks to hypergraph networks. We call our new method Tensor-SCORE. In theory, we introduce a degree-corrected block model for hypergraphs (hDCBM), and show that Tensor-SCORE yields consistent community detection for a wide range of network sparsity and degree heterogeneity. As a byproduct, we derive the rates of convergence on estimating the principal subspace by reg-HOOI, with different initializations, including the two new initialization methods we propose, a diagonal-removed HOSVD and a randomized graph projection. We apply our method to several real hypergraph networks which yields encouraging results. It suggests that exploring higher-order interactions provides additional information not seen in graph representations.

[1]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Hongyu Zhao,et al.  Characterizing Spatiotemporal Transcriptome of the Human Brain Via Low-Rank Tensor Decomposition , 2017, Statistics in Biosciences.

[3]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[4]  Mason A. Porter,et al.  Time-dependent community structure in legislation cosponsorship networks in the Congress of the Republic of Peru , 2015, J. Complex Networks.

[5]  Ming Yuan,et al.  Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion , 2016, IEEE Transactions on Information Theory.

[6]  J. Fowler.  Connecting the Congress: A Study of Cosponsorship Networks , 2006, Political Analysis.

[7]  Andrea Montanari,et al.  A statistical model for tensor PCA , 2014, NIPS.

[8]  Ming Yuan,et al.  On Tensor Completion via Nuclear Norm Minimization , 2014, Foundations of Computational Mathematics.

[9]  Jonathan Shi,et al.  Tensor principal component analysis via sum-of-square proofs , 2015, COLT.

[10]  Jerrold W. Grossman,et al.  The evolution of the mathematical research collaboration graph , 2002 .

[11]  Jiashun Jin,et al.  Optimal adaptivity of signed-polygon statistics for network testing , 2019, The Annals of Statistics.

[12]  Jianqing Fan,et al.  ENTRYWISE EIGENVECTOR ANALYSIS OF RANDOM MATRICES WITH LOW EXPECTED RANK. , 2017, Annals of statistics.

[13]  Dong Xia,et al.  Optimal estimation of low rank density matrices , 2015, J. Mach. Learn. Res..

[14]  VandewalleJoos,et al.  On the Best Rank-1 and Rank-(R1,R2,. . .,RN) Approximation of Higher-Order Tensors , 2000 .

[15]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[16]  Jacob G. Foster,et al.  Weaving the fabric of science: Dynamic network models of science's unfolding structure , 2015, Soc. Networks.

[17]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[18]  I-Hsiang Wang,et al.  On the fundamental statistical limit of community detection in random hypergraphs , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[19]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[20]  I-Hsiang Wang,et al.  Community Detection in Hypergraphs: Optimal Statistical Limit and Efficient Algorithms , 2018, AISTATS.

[21]  J. Grilli,et al.  Higher-order interactions stabilize dynamics in competitive network models , 2017, Nature.

[22]  Tai Qin,et al.  Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel , 2013, NIPS.

[23]  Anru R. Zhang,et al.  Tensor SVD: Statistical and Computational Limits , 2017, IEEE Transactions on Information Theory.

[24]  Jiashun Jin,et al.  FAST COMMUNITY DETECTION BY SCORE , 2012, 1211.5803.

[25]  Zheng Tracy Ke,et al.  A new SVD approach to optimal topic estimation , 2017 .

[26]  Joos Vandewalle,et al.  On the Best Rank-1 and Rank-(R1 , R2, ... , RN) Approximation of Higher-Order Tensors , 2000, SIAM J. Matrix Anal. Appl..

[27]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Ambedkar Dukkipati,et al.  A Provable Generalized Tensor Spectral Method for Uniform Hypergraph Partitioning , 2015, ICML.

[29]  V. Koltchinskii.  Von Neumann Entropy Penalization and Low Rank Matrix Estimation , 2010, 1009.2439.

[30]  Kangwook Lee,et al.  Information-theoretic limits of subspace clustering , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[31]  E. Giné,et al.  Some Limit Theorems for Empirical Processes , 1984 .

[32]  Jiashun Jin,et al.  Coauthorship and Citation Networks for Statisticians , 2014, ArXiv.

[33]  Joos Vandewalle,et al.  A Multilinear Singular Value Decomposition , 2000, SIAM J. Matrix Anal. Appl..

[34]  Yuan Zhang,et al.  Detecting Overlapping Communities in Networks Using Spectral Methods , 2014, SIAM J. Math. Data Sci..

[35]  P. Bickel,et al.  A nonparametric view of network models and Newman–Girvan and other modularities , 2009, Proceedings of the National Academy of Sciences.

[36]  Ambedkar Dukkipati,et al.  Consistency of Spectral Partitioning of Uniform Hypergraphs under Planted Partition Model , 2014, NIPS.

[37]  Florent Krzakala,et al.  Spectral detection on sparse hypergraphs , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[38]  Bin Yu,et al.  Spectral clustering and the high-dimensional stochastic blockmodel , 2010, 1007.1684.

[39]  Fan Zhou,et al.  The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising , 2019, J. Mach. Learn. Res..

[40]  Ambedkar Dukkipati,et al.  Consistency of spectral hypergraph partitioning under planted partition model , 2015, 1505.01582.

[41]  V. Koltchinskii,et al.  Nuclear norm penalization and optimal rates for noisy low rank matrix completion , 2010, 1011.6256.

[42]  L. Tucker,et al.  Some mathematical notes on three-mode factor analysis , 1966, Psychometrika.

[43]  Bernhard Schölkopf,et al.  Learning with Hypergraphs: Clustering, Classification, and Embedding , 2006, NIPS.

[44]  Jiashun Jin,et al.  Estimating network memberships by simplex vertex hunting , 2017 .

[45]  Andrea Montanari,et al.  Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.

[46]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[47]  Michel X. Goemans,et al.  Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach , 2018, ArXiv.

[48]  Ambedkar Dukkipati,et al.  Spectral Clustering Using Multilinear SVD: Analysis, Approximations and Applications , 2015, AAAI.

[49]  Ming Yuan,et al.  Statistically Optimal and Computationally Efficient Low Rank Tensor Completion from Noisy Entries , 2017, The Annals of Statistics.

[50]  Chao Gao,et al.  Community Detection in Degree-Corrected Block Models , 2016, The Annals of Statistics.