Consistency Thresholds for the Planted Bisection Model

ACM Symposium on Theory of Computing, pp. 69-75, 2015.

Cited by: 108|Views32
EI

Abstract:

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 bisecti...More

Code:

Data:

Your rating :
0

 

Tags
Comments