Exact recovery of community detection in k-partite graph models with applications to learning electric potentials in electric networks
From MaRDI portal
Publication:2658079
Recommendations
- Non-convex exact community recovery in stochastic block model
- Semidefinite programs on sparse random graphs and their application to community detection
- Community detection and stochastic block models: recent developments
- Exact clustering of weighted graphs via semidefinite programming
- Recovering a hidden community beyond the Kesten-Stigum threshold in \(O(| E|\log^\ast| V|)\) time
Cites work
- scientific article; zbMATH DE number 1962931 (Why is no real title available?)
- A proof of the block model threshold conjecture
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- BOULWARE STATE IN EXACTLY SOLVABLE MODELS OF 2D DILATON GRAVITY
- Community detection and stochastic block models
- Community detection thresholds and the weak Ramanujan property
- Community structure in social and biological networks
- Exact Recovery in the Stochastic Block Model
- Phase transitions in semidefinite relaxations
- Random graph models of social networks
- Semidefinite programs on sparse random graphs and their application to community detection
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- The extremes of a triangular array of normal random variables
This page was built for publication: Exact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2658079)