Bicoloring Random Hypergraphs
Tommaso Castellani, Vincenzo Napolano, Federico Ricci-Tersenghi, Riccardo Zecchina
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.
Create a lesson
Related papers
Coupling spherical p-spin systems
Riccardo Cipolloni, Leticia F. Cugliandolo
Bias-Induced Crossover in Absolute Capacity of Dense Associative Memory
Yuto Sakurai, Takeaki Shimokawa, Kazunori Iwata et al.
Latent kinetic Ising models of neural spike trains
Davide Ghio, David Saad
Nonlocal Magic across the Many-Body Localization Crossover
Shan-Zhong Li, Zhi Li
Statistical levels and spatial modes of Fock-space heterogeneity in many-body localization crossovers
Yu-Jing Liu, Chen Cheng
Disorder-Tailored Delocalization
Yeongjun Kim, Supriyo Ghosh, Sergej Flach