Bicoloring Random Hypergraphs
Disordered Systems and Neural Networks
2009-11-10 v2 Statistical Mechanics
Abstract
We study the problem of bicoloring random hypergraphs, both numerically and analytically. We apply the zero-temperature cavity method to find analytical results for the phase transitions (dynamic and static) in the 1RSB approximation. These points appear to be in agreement with the results of the numerical algorithm. In the second part, we implement and test the Survey Propagation algorithm for specific bicoloring instances in the so called HARD-SAT phase.
Keywords
Cite
@article{arxiv.cond-mat/0306369,
title = {Bicoloring Random Hypergraphs},
author = {Tommaso Castellani and Vincenzo Napolano and Federico Ricci-Tersenghi and Riccardo Zecchina},
journal= {arXiv preprint arXiv:cond-mat/0306369},
year = {2009}
}
Comments
14 pages, 10 figures