Optimal Bipartite Network Clustering
From MaRDI portal
Publication:4969080
zbMath1498.68281arXiv1803.06031MaRDI QIDQ4969080
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1803.06031
network analysispseudo-likelihoodcommunity detectionspectral clusteringstochastic block modelbiclusteringbipartite networks
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Heteroskedastic PCA: algorithm, optimality, and applications, Identifiability and parameter estimation of the overlapped stochastic co-block model, Rate optimal Chernoff bound and application to community detection in the stochastic block models, Adjusted chi-square test for degree-corrected block models, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Analysis of spectral clustering algorithms for community detection: the general bipartite setting
Cites Work
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Consistency thresholds for the planted bisection model
- Minimax rates of community detection in stochastic block models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral clustering in the dynamic stochastic block model
- Community detection in sparse networks via Grothendieck's inequality
- The tail of the hypergeometric distribution
- On semidefinite relaxations for the block model
- Random Laplacian matrices and convex relaxations
- Community detection in degree-corrected block models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Optimal rates for community estimation in the weighted stochastic block model
- Consistency of spectral clustering in stochastic block models
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral redemption in clustering sparse networks
- Phase transitions in semidefinite relaxations
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Exact Recovery in the Stochastic Block Model
- The Poisson Approximation to the Poisson Binomial Distribution
- Asymptotic error probability of binary hypothesis testing for Poisson point-process observations (Corresp.)
- Estimation and Prediction for Stochastic Blockstructures
- Community Detection and Stochastic Block Models
- A Simple SVD Algorithm for Finding Hidden Partitions
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Community detection thresholds and the weak Ramanujan property
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Semidefinite programs on sparse random graphs and their application to community detection
- A simple proof of Stirling's formula for the gamma function
- Elements of Information Theory
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
