Spanning Trees in Random Satisfiability Problems
无序系统与神经网络
2009-11-11 v2 统计力学
摘要
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the associated factor graph. We introduce a modified survey propagation algorithm which returns null edges of the factor graph and helps us to find satisfiable spanning trees. This allows us to study organization of satisfiable spanning trees in the space spanned by spanning trees.
引用
@article{arxiv.cond-mat/0507231,
title = {Spanning Trees in Random Satisfiability Problems},
author = {A. Ramezanpour and S. Moghimi-Araghi},
journal= {arXiv preprint arXiv:cond-mat/0507231},
year = {2009}
}
备注
12 pages, 5 figures, published version