A Spectral Approach to Analyzing Belief Propagation for 3-Coloring
Carnegie Mellon University（卡内基梅隆大学）；U.C. Berkeley（加州大学伯克利分校）；Tel-Aviv University（特拉维夫大学）
英文摘要：
Contributing to the rigorous understanding of BP, in this paper we relate the convergence of BP to spectral properties of the graph. This encompasses a result for random graphs with a ``planted'' solution; thus, we obtain the first rigorous result on BP for graph coloring in the case of a complex graphical structure (as opposed to trees). In particular, the analysis shows how Belief Propagation breaks the symmetry between the $3!$ possible permutations of the color classes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
