arXiv (All)
open access
Tightness and Error Exponents of SDP with Logarithmically Many Communities
We study a semidefinite programming (SDP) relaxation for community recovery when the number of communities grows logarithmically. In the balanced stochastic block model with $n=km$ vertices, we consider the regime $k/\log m\toγ>0$, with edge probabilities $α\log m/m$ within communities and $β\log m/
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp decay characterization for the Oldroyd-B system with only velocity dissipation#1327818
- LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS#631196
- Forward-backward correspondence between stationary structure and splitting probabilities in active matter#1118624
- Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT#1344866
- Boundedness and exponential stabilization in a degenerate migration-consumption system with logistic damping#1327989
Record · ID 1233342
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive