Random graph with latent community structure — detectability phase transition
The SBM generates random graphs with block structure: nodes in the same community connect with probability p_in, across communities with p_out. The Kesten-Stigum threshold (p_in − p_out)² > K·p_avg defines detectability — below it, no algorithm can find communities better than chance.