SOTAVerified

Stochastic Block Model

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 201–250 of 370 papers

TitleStatusHype
Phase transitions and optimal algorithms for semi-supervised classifications on graphs: from belief propagation to graph convolution network—0
Phase transitions in semisupervised clustering of sparse networks—0
Privacy-Preserving Community Detection for Locally Distributed Multiple Networks—0
Consistency of Constrained Spectral Clustering under Graph Induced Fair Planted Partitions—0
Pseudo-likelihood methods for community detection in large sparse networks—0
Quantifying the Controllability of Coarsely Characterized Networked Dynamical Systems—0
Query Complexity of Clustering with Side Information—0
Scalable and Robust Community Detection with Randomized Sketching—0
Randomized Spectral Clustering in Large-Scale Stochastic Block Models—0
Rates of Convergence of Spectral Methods for Graphon Estimation—0
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions—0
Reconstruction in the Labeled Stochastic Block Model—0
Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in O(|E| ^*|V|) Time—0
Recovering communities in the general stochastic block model without knowing the parameters—0
Recovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle—0
Recurrent segmentation meets block models in temporal networks—0
Regularized spectral methods for clustering signed networks—0
Regular Partitions and Their Use in Structural Pattern Recognition—0
Reinforcement Learning for SBM Graphon Games with Re-Sampling—0
Relative Density and Exact Recovery in Heterogeneous Stochastic Block Models—0
Restricted Tweedie Stochastic Block Models—0
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes—0
Robustness of Community Detection to Random Geometric Perturbations—0
Robust recovery for stochastic block models—0
Robust spectral clustering using LASSO regularization—0
Scaling Graph Clustering with Distributed Sketches—0
Selecting the Number of Communities for Weighted Degree-Corrected Stochastic Block Models—0
Semidefinite Programs for Exact Recovery of a Hidden Community—0
Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold—0
Semi-supervised Community Detection via Structural Similarity Metrics—0
Sharp Bounds for Poly-GNNs and the Effect of Graph Noise—0
Signal processing on large networks with group symmetries—0
Sketch-based community detection in evolving networks—0
Smoothing Graphons for Modelling Exchangeable Relational Data—0
Social Learning under Platform Influence: Consensus and Persistent Disagreement—0
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality—0
Sparse and Smooth: improved guarantees for Spectral Clustering in the Dynamic Stochastic Block Model—0
Sparse Popularity Adjusted Stochastic Block Model—0
Sparse Subspace Clustering in Diverse Multiplex Network Model—0
Spectral Algorithms Optimally Recover Planted Sub-structures—0
Spectral clustering for dependent community Hawkes process models of temporal networks—0
Spectral clustering in the dynamic stochastic block model—0
Spectral embedding of weighted graphs—0
Spectral Clustering of Signed Graphs via Matrix Power Means—0
Spectral Clustering Revisited: Information Hidden in the Fiedler Vector—0
Spectral clustering under degree heterogeneity: a case for the random walk Laplacian—0
Spectral redemption: clustering sparse networks—0
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices—0
The Hierarchy of Block Models—0
Statistical Limits of Convex Relaxations—0
Show:102550
← PrevPage 5 of 8Next →

No leaderboard results yet.