Robust and computationally feasible community detection in the presence of arbitrary outlier nodes

23 April 2014

T. Tony Cai

Papers citing "Robust and computationally feasible community detection in the presence of arbitrary outlier nodes"

28 / 28 papers shown

Title
Selecting the Number of Communities for Weighted Degree-Corrected Stochastic Block Models Yucheng Liu Xiaodong Li 46 0 0 08 Jun 2024
Adversarial contamination of networks in the setting of vertex nomination: a new trimming method Sheyda Peyman M. Tang V. Lyzinski AAML 28 0 0 20 Aug 2022
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits Doyeon Kim Jeonghwa Lee Hye Won Chung 45 3 0 19 Nov 2021
Robust Estimation for Random Graphs Jayadev Acharya Ayush Jain Gautam Kamath A. Suresh Huanyu Zhang 30 8 0 09 Nov 2021
Community detection for weighted bipartite networks Huan Qing Jingli Wang 47 11 0 21 Sep 2021
Generalized Low-rank plus Sparse Tensor Estimation by Fast Riemannian Optimization Jian-Feng Cai Jingyang Li Dong Xia 49 30 0 16 Mar 2021
Projection-based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices M. Kaloorazi Jie Chen 19 9 0 12 Mar 2021
Spectral Methods for Data Science: A Statistical Perspective Yuxin Chen Yuejie Chi Jianqing Fan Cong Ma 40 165 0 15 Dec 2020
Spectral clustering via adaptive layer aggregation for multi-layer networks Sihan Huang Haolei Weng Yang Feng 28 21 0 07 Dec 2020
Next Waves in Veridical Network Embedding Owen G. Ward Zhen Huang Andrew Davison Tian Zheng GNN 8 5 0 10 Jul 2020
Edgeworth expansions for network moments Yuan Zhang Dong Xia 32 25 0 14 Apr 2020
All-In-One Robust Estimator of the Gaussian Mean A. Dalalyan A. Minasyan 26 25 0 04 Feb 2020
Neuroscience-inspired online unsupervised learning algorithms C. Pehlevan D. Chklovskii 16 54 0 05 Aug 2019
Vertex Nomination, Consistent Estimation, and Adversarial Modification Joshua Agterberg Youngser Park Jonathan Larson Christopher M. White Carey E. Priebe V. Lyzinski 37 16 0 06 May 2019
Convex optimization for the densest subgraph and densest submatrix problems Polina Bombina Brendan P. W. Ames 29 9 0 05 Apr 2019
Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networks Mingchen Li Mahdi Soltanolkotabi Samet Oymak NoLa 47 351 0 27 Mar 2019
Two provably consistent divide and conquer clustering algorithms for large networks Soumendu Sundar Mukherjee Purnamrita Sarkar Peter J. Bickel 23 12 0 18 Aug 2017
Provable Estimation of the Number of Blocks in Block Models Bowei Yan Purnamrita Sarkar Xiuyuan Cheng 27 32 0 24 May 2017
Density Evolution in the Degree-correlated Stochastic Block Model Elchanan Mossel Jiaming Xu 14 36 0 10 Sep 2015
Local Algorithms for Block Models with Side Information Elchanan Mossel Jiaming Xu 30 49 0 10 Aug 2015
A semidefinite program for unbalanced multisection in the stochastic block model William Perry Alexander S. Wein 19 49 0 20 Jul 2015
Minimax Rates of Community Detection in Stochastic Block Models A. Zhang Harrison H. Zhou 32 185 0 19 Jul 2015
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions Bruce Hajek Yihong Wu Jiaming Xu 37 136 0 26 Feb 2015
Sparse random graphs: regularization and concentration of the Laplacian Can M. Le Elizaveta Levina Roman Vershynin 39 56 0 10 Feb 2015
Detecting Overlapping Communities in Networks Using Spectral Methods Yuan Zhang Elizaveta Levina Ji Zhu 46 103 0 10 Dec 2014
Improved Graph Clustering Yudong Chen Sujay Sanghavi Huan Xu 94 191 0 11 Oct 2012
Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels Peter J. Bickel David S. Choi Xiangyu Chang Hai Zhang 71 220 0 04 Jul 2012
A survey of statistical network models Anna Goldenberg A. Zheng S. Fienberg E. Airoldi 131 976 0 29 Dec 2009