# Consistency thresholds for the planted bisection model

@article{Mossel2016ConsistencyTF, title={Consistency thresholds for the planted bisection model}, author={Elchanan Mossel and Joe Neeman and Allan Sly}, journal={Electronic Journal of Probability}, year={2016}, volume={21} }

The planted bisection model is a random graph model in which the nodes are divided into two equal-sized communities and then edges are added randomly in a way that depends on the community membership. We establish necessary and sufficient conditions for the asymptotic recoverability of the planted bisection in this model. When the bisection is asymptotically recoverable, we give an efficient algorithm that successfully recovers it. We also show that the planted bisection is recoverable… Expand

#### Topics from this paper

#### 74 Citations

The Minimum Bisection in the Planted Bisection Model

- Mathematics, Computer Science
- Theory Comput.
- 2017

1- PDF

Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's

- Computer Science, Mathematics
- NIPS
- 2015

17- PDF

Spectral thresholds in the bipartite stochastic block model

- Mathematics, Computer Science
- COLT
- 2016

37- PDF

Computational Lower Bounds for Community Detection on Random Graphs

- Mathematics, Computer Science
- COLT
- 2015

81- PDF

Optimal hypothesis testing for stochastic block models with growing degrees

- Mathematics, Computer Science
- ArXiv
- 2017

25- PDF

Connectivity in Random Annulus Graphs and the Geometric Block Model

- Mathematics, Computer Science
- APPROX-RANDOM
- 2019

5- PDF

Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery

- Mathematics, Computer Science
- ICALP
- 2018

4- PDF

#### References

SHOWING 1-10 OF 24 REFERENCES

The Metropolis Algorithm for Graph Bisection

- Computer Science, Mathematics
- Discret. Appl. Math.
- 1998

146

Exact Recovery in the Stochastic Block Model

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2016

417 Highly Influential- PDF

Algorithms for graph partitioning on the planted partition model

- Computer Science
- Random Struct. Algorithms
- 2001

376

Spectral partitioning of random graphs

- Computer Science
- Proceedings 2001 IEEE International Conference on Cluster Computing
- 2001

576 Highly Influential- PDF

Community detection thresholds and the weak Ramanujan property

- Mathematics, Computer Science
- STOC
- 2014

341 Highly Influential- PDF

Eigenvalues and graph bisection: An average-case analysis

- Computer Science, Mathematics
- 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
- 1987

385

The Solution of Some Random NP-Hard Problems in Polynomial Expected Time

- Mathematics, Computer Science
- J. Algorithms
- 1989

189 Highly Influential