irrespective of its cluster membership. We further consider a sparse and assortative SSBM. The SBMM is called sparse and assortative when the link probabilities \(p_{in}=\frac{b_{in}}{N}\)  and \(p_{out}=\frac{b_{out}}{N}\)  are defined upon positive constants \(b_{in}>b_{out}\)  that stay constant when \(N \rightarrow \infty \) . Decelle et al. [1]}, [2]} found that when the difference \(b_{in}-b_{out}\)  is above the detectability threshold
\(b_{in} - b_{out} > c\cdot \sqrt{E[D]},\) 
