Covariate Regularized Community Detection in Sparse Graphs

DOI10.1080/01621459.2019.1706541zbMath1464.62333arXiv1607.02675OpenAlexW2998266148WikidataQ126395615 ScholiaQ126395615MaRDI QIDQ4999151

Bowei Yan, Purnamrita Sarkar

Publication date: 6 July 2021

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.02675

zbMATH Keywords

semidefinite programmingasymptotic analysiskernel methodstochastic block modelssub-Gaussian mixture

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of variance and covariance (ANOVA) (62J10)

Related Items (6)

Community informed experimental design ⋮ Covariate-Assisted Community Detection in Multi-Layer Networks ⋮ Unnamed Item ⋮ Joint Latent Space Model for Social Networks with Multivariate Attributes ⋮ An \({\ell_p}\) theory of PCA and spectral clustering ⋮ Unnamed Item

Uses Software

• SDPLR
• SDPNAL+
• 2EBD-HPE

Cites Work

• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
• Community detection in networks with node features
• Statistical guarantees for the EM algorithm: from population to sample-based analysis
• A spectral algorithm for learning mixture models
• On information plus noise kernel random matrices
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Spectral clustering and the high-dimensional stochastic blockmodel
• Community detection in sparse networks via Grothendieck's inequality
• A tail inequality for quadratic forms of subgaussian random vectors
• A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
• Data spectroscopy: eigenspaces of convolution operators and clustering
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• Detection and feature selection in sparse mixture models
• Phase transitions for high dimensional clustering and related problems
• On semidefinite relaxations for the block model
• Monogamy inequality in terms of entanglement measures based on distance for pure multiqubit states
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
• The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
• Mixed membership stochastic blockmodels
• Tensor Completion in Hierarchical Tensor Representations
• Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
• Robust Control via Sequential Semidefinite Programming
• Clustering subgaussian mixtures by semidefinite programming
• Semidefinite Programming
• Semidefinite programs on sparse random graphs and their application to community detection
• Covariate-assisted spectral clustering
• THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
• Approximating K‐means‐type Clustering via Semidefinite Programming
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: Covariate Regularized Community Detection in Sparse Graphs