arXiv · cond-mat/0306369
Bicoloring Random Hypergraphs
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tommaso Castellani, Vincenzo Napolano, Federico Ricci-Tersenghi, Riccardo Zecchina. 2003-07-24. Bicoloring Random Hypergraphs. https://doi.org/10.1088/0305-4470%2F36%2F43%2F026. https://searcharxiv.com/abs/cond-mat/0306369
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.