SBM: n nodes in k groups. Edges within groups with prob p_in, between groups with p_out. Detectability threshold (Decelle et al 2011): detection is possible iff (p_in − p_out)² > k²(p_in + p_out)/n. Below this, no algorithm can recover communities better than chance.
Detectability: — | SNR = (p_in − p_out)²·n / [k²(p_in+p_out)] | Threshold SNR = 1