arXiv · 0903.1621
Susceptibility Propagation for Constraint Satisfaction Problems
Abstract
We study the susceptibility propagation, a message-passing algorithm to compute correlation functions. It is applied to constraint satisfaction problems and its accuracy is examined. As a heuristic method to find a satisfying assignment, we propose susceptibility-guided decimation where correlations among the variables play an important role. We apply this novel decimation to locked occupation problems, a class of hard constraint satisfaction problems exhibited recently. It is shown that the present method performs better than the standard belief-guided decimation.
Explore related subjects
Keep this discovery
Saburo Higuchi, Marc Mézard. 2009-03-09. Susceptibility Propagation for Constraint Satisfaction Problems. https://doi.org/10.1088/1742-6596%2F233%2F1%2F012003
Cite the original work for its findings. Save a collection to share your selection of sources.