Abstract
We study the disassortative stochastic block model with three communities, a well-studied model of graph partitioning and Bayesian inference for which detailed predictions based on the cavity method exist (Decelle et al. in Phys Rev E 84:066106, 2011). We provide strong evidence that for a part of the phase where efficient algorithms exist that approximately reconstruct the communities, inference based on maximum a posteriori (MAP) fails. In other words, we show that there exist modes of the posterior distribution that have a vanishing agreement with the ground truth. The proof is based on the analysis of a graph colouring algorithm from Achlioptas and Moore (J Comput Syst Sci 67:441–471, 2003).
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have