arXiv Analytics

Sign in

arXiv:cond-mat/0103328AbstractReferencesReviewsResources

Exact solutions for diluted spin glasses and optimization problems

S. Franz, M. Leone, F. Ricci-Tersenghi, R. Zecchina

Published 2001-03-15, updated 2001-08-15Version 2

We study the low temperature properties of p-spin glass models with finite connectivity and of some optimization problems. Using a one-step functional replica symmetry breaking Ansatz we can solve exactly the saddle-point equations for graphs with uniform connectivity. The resulting ground state energy is in perfect agreement with numerical simulations. For fluctuating connectivity graphs, the same Ansatz can be used in a variational way: For p-spin models (known as p-XOR-SAT in computer science) it provides the exact configurational entropy together with the dynamical and static critical connectivities (for p=3, \gamma_d=0.818 and \gamma_s=0.918 resp.), whereas for hard optimization problems like 3-SAT or Bicoloring it provides new upper bounds for their critical thresholds (\gamma_c^{var}=4.396 and \gamma_c^{var}=2.149 resp.).

Comments: 4 pages, 1 figure, accepted for publication in PRL
Journal: Phys. Rev. Lett. 87 (2001) 127209
Related articles: Most relevant | Search more
arXiv:2001.03903 [cond-mat.dis-nn] (Published 2020-01-12)
A simple relation between frustration and transition points in diluted spin glasses
arXiv:1608.05105 [cond-mat.dis-nn] (Published 2016-08-17)
Evolutionary Approaches to Optimization Problems in Chimera Topologies
arXiv:cond-mat/0410579 (Published 2004-10-22, updated 2005-03-11)
Number and length of attractors in a critical Kauffman model with connectivity one