A Spectral Approach to Analyzing Belief Propagation for 3-Coloring

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-469469

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.