Exact Recovery in the Stochastic Block Model

From MaRDI portal
Revision as of 20:20, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2977080

DOI10.1109/TIT.2015.2490670zbMath1359.94047arXiv1405.3267OpenAlexW2963264680MaRDI QIDQ2977080

Emmanuel Abbe, Georgina Hall, Afonso S. Bandeira

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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




Related Items (91)

Joint Alignment from Pairwise Differences with a Noisy OracleEstimating Mixed Memberships With Sharp Eigenvector DeviationsOn Convex Hulls of Epigraphs of QCQPsIterative algorithm for discrete structure recoveryOn the tightness of SDP relaxations of QCQPsBayesian community detectionAsymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimatorWeighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side InformationOptimal Bipartite Network ClusteringCommunity detection with a subsampled semidefinite programThe Ratio-Cut Polytope and K-Means ClusteringUnnamed ItemFrequentist validity of Bayesian limitsExact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networksLocal law and Tracy-Widom limit for sparse stochastic block modelsOptimal rates for community estimation in the weighted stochastic block modelProbably certifiably correct \(k\)-means clusteringSpectral and structural properties of random interdependent networksConvexified modularity maximization for degree-corrected stochastic block modelsJoint Community Detection and Rotational Synchronization via Semidefinite ProgrammingFind Your Place: Simple Distributed Algorithms for Community Detection\(k\)-median: exact recovery in the extended stochastic ball modelEfficient joint object matching via linear programmingCertifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clusteringCommunity detection in the sparse hypergraph stochastic block modelFast Network Community Detection With Profile-Pseudo Likelihood MethodsA unified approach to synchronization problems over subgroups of the orthogonal groupUnnamed ItemUnnamed ItemEfficient, certifiably optimal clustering with applications to latent variable graphical modelsA note on probably certifiably correct algorithmsMean estimation with sub-Gaussian rates in polynomial timeEntrywise eigenvector analysis of random matrices with low expected rankMutual information for the sparse stochastic block modelAn inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimizationA Spectral Method for Joint Community Detection and Orthogonal Group SynchronizationAsymptotic uncertainty quantification for communities in sparse planted bi-section modelsEntrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signalsSpectral Clustering via Adaptive Layer Aggregation for Multi-Layer NetworksCommunity Detection in Censored HypergraphSpectral norm bounds for block Markov chain random matricesA UNIFIED COMMUNITY DETECTION ALGORITHM IN LARGE-SCALE COMPLEX NETWORKSAsymptotic mutual information for the balanced binary stochastic block modelStep-by-step community detection in volume-regular graphsHidden Hamiltonian Cycle Recovery via Linear ProgrammingRecovering Structured Probability MatricesSparse general Wigner-type matrices: Local law and eigenvector delocalizationSemi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate RecoveryDetecting groups in large vector autoregressionsUnnamed ItemOn semidefinite relaxations for the block modelContiguity and non-reconstruction results for planted partition models: the dense caseRandom Laplacian matrices and convex relaxationsSubmatrix localization via message passingCommunity Detection and Stochastic Block ModelsClustering in block Markov chainsStatistical inference on random dot product graphs: a surveyTightness of the maximum likelihood semidefinite relaxation for angular synchronizationDistribution-Free, Size Adaptive Submatrix Detection with AccelerationA goodness-of-fit test for stochastic block modelsConvex relaxation methods for community detectionMinimax rates in network analysis: graphon estimation, community detection and hypothesis testingRobust high-dimensional factor models with applications to statistical machine learningSubspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guaranteesConvex optimization for the densest subgraph and densest submatrix problemsThe geometry of continuous latent space models for network dataCommunity detection in degree-corrected block modelsUnnamed ItemNetwork Cross-Validation for Determining the Number of Communities in Network DataRank Optimality for the Burer--Monteiro FactorizationConsistent nonparametric estimation for heavy-tailed sparse graphsLearning directed acyclic graph SPNs in sub-quadratic timeExact recovery in the hypergraph stochastic block model: a spectral algorithmExact recovery in the Ising blockmodelTesting for high-dimensional geometry in random graphsProximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex ProblemsThe Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard RegimeA spectral method for community detection in moderately sparse degree-corrected stochastic block modelsExact Clustering of Weighted Graphs via Semidefinite ProgrammingSpectral clustering revisited: information hidden in the Fiedler vectorUnnamed ItemNon-unique games over compact groups and orientation estimation in cryo-EMNon-convex exact community recovery in stochastic block modelSharp optimal recovery in the two component Gaussian mixture modelAn \({\ell_p}\) theory of PCA and spectral clusteringUnnamed ItemUnnamed ItemGlobal and individualized community detection in inhomogeneous multilayer networksBootstrap percolation on the stochastic block modelHidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture ModelThe planted k-factor problem




This page was built for publication: Exact Recovery in the Stochastic Block Model