Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Catching the k-NAESAT threshold

Tools
- Tools
+ Tools

Coja-Oghlan, Amin and Panagiotou, Konstantinos (2011) Catching the k-NAESAT threshold. Coventry: ArXiv e-prints. (Unpublished)

Full text not available from this repository.
Official URL: http://arxiv.org/abs/1111.1274

Abstract

The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment method. Yet apart from a very few exceptional cases these methods do not quite yield matching upper and lower bounds. According to deep but non-rigorous arguments from statistical mechanics, this discrepancy is due to a change in the geometry of the set of solutions called condensation that occurs shortly before the actual threshold for the existence of solutions (Krzakala, Montanari, Ricci-Tersenghi, Semerjian, Zdeborova: PNAS 2007). To cope with condensation, physicists have developed a sophisticated but non-rigorous formalism called Survey Propagation (Mezard, Parisi, Zecchina: Science 2002). This formalism yields precise conjectures on the threshold values of many random CSPs. Here we develop a new Survey Propagation inspired second moment method for the random k-NAESAT problem, which is one of the standard benchmark problems in the theory of random CSPs. This new technique allows us to overcome the barrier posed by condensation rigorously. We prove that the threshold for the existence of solutions in random $k$-NAESAT is $2^{k-1}\ln2-(\frac{\ln2}2+\frac14)+\eps_k$, where $|\eps_k| \le 2^{-(1-o_k(1))k}$, thereby verifying the statistical mechanics conjecture for this problem.

Item Type: Scholarly Text
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science > Computer Science
Faculty of Science > Mathematics
Series Name: ArXiv e-prints
Publisher: ArXiv e-prints
Place of Publication: Coventry
Date: 2011
Number: No.1111.1274v1
Number of Pages: 40
Status: Not Peer Reviewed
Publication Status: Unpublished
Access rights to Published version: Open Access
Description: Preprint
Funder: EPSRC, ERC Starting Grant
Grant number: EP/G039070/2, 278857–PTCC (FP7)
Related URLs:
  • Publisher
URI: http://wrap.warwick.ac.uk/id/eprint/48797

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us