Consistency thresholds for the planted bisection model

DOI10.1145/2746539.2746603MaRDI QIDQ6826249zbMATH OpenFDO

Authors Elchanan Mossel, Joe Neeman, Allan Sly

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2746539.2746603

zbMATH Keywords

graph clusteringminimum bisectionplanted partition modelrandom graphstochastic block model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited in

(4)

• Nonconvex landscapes for \(\mathbf{Z}_2\) synchronization and graph clustering are benign near exact recovery thresholds
• Exact recovery discrimination in planted bisection model
• Phase transition detection in the community detection for hypergraph network via tensor method
• Is the space complexity of planted clique recovery the same as that of detection?

This page was built for publication: Consistency thresholds for the planted bisection model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826249)