Computer Science – Computational Complexity
Scientific paper
2007-12-02
Computer Science
Computational Complexity
Scientific paper
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.
Coja-Oghlan Amin
Mossel Elchanan
Vilenchik Dan
No associations
LandOfFree
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Spectral Approach to Analyzing Belief Propagation for 3-Coloring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Spectral Approach to Analyzing Belief Propagation for 3-Coloring will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-469469