Community detection in signed networks: a penalized semidefinite programming framework
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7370586 (Why is no real title available?)
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- Community detection in sparse networks via Grothendieck's inequality
- Community structure in social and biological networks
- Consistency of community detection in networks under degree-corrected stochastic block models
- Covariate regularized community detection in sparse graphs
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Entrywise eigenvector analysis of random matrices with low expected rank
- Exact Recovery in the Stochastic Block Model
- Exploring complex networks
- Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method
- Networks, crowds and markets. Reasoning about a highly connected world.
- On semidefinite relaxations for the block model
- On the notion of balance of a signed graph
- Prediction and clustering in signed networks: a local to global perspective
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Semidefinite programming based community detection for node-attributed networks and multiplex networks
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
- The evolution of beliefs over signed social networks
This page was built for publication: Community detection in signed networks: a penalized semidefinite programming framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909678)
