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
74 Citations
Consistency Thresholds for the Planted Bisection Model
  • 84
  • PDF
The Minimum Bisection in the Planted Bisection Model
  • 1
  • PDF
New Abilities and Limitations of Spectral Graph Bisection
  • PDF
Spectral thresholds in the bipartite stochastic block model
  • 37
  • PDF
Optimal Bipartite Network Clustering
  • 14
  • PDF
Computational Lower Bounds for Community Detection on Random Graphs
  • 81
  • PDF
Optimal hypothesis testing for stochastic block models with growing degrees
  • 25
  • PDF
Connectivity in Random Annulus Graphs and the Geometric Block Model
  • 5
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
The Metropolis Algorithm for Graph Bisection
  • 146
Exact Recovery in the Stochastic Block Model
  • 417
  • Highly Influential
  • PDF
Graph bisection algorithms with good average case behavior
  • 260
Algorithms for graph partitioning on the planted partition model
  • 376
A Proof of the Block Model Threshold Conjecture
  • 232
  • PDF
Spectral partitioning of random graphs
  • F. McSherry
  • Computer Science
  • Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
  • 576
  • Highly Influential
  • PDF
Community detection thresholds and the weak Ramanujan property
  • 341
  • Highly Influential
  • PDF
Eigenvalues and graph bisection: An average-case analysis
  • R. Boppana
  • Computer Science, Mathematics
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
  • 385
Community Detection via Random and Adaptive Sampling
  • 45
  • PDF
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time
  • 189
  • Highly Influential
...
1
2
3
...