Document Open Access Logo

Belief Propagation Guided Decimation on Random k-XORSAT

Authors Arnab Chatterjee, Amin Coja-Oghlan , Mihyun Kang , Lena Krieg, Maurice Rolvien, Gregory B. Sorkin

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.47.pdf
  • Filesize: 1.06 MB
  • 21 pages
HTML5 Logo HTML (experimental)
LIPIcs.ICALP.2025.47.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Probability and statistics
  • Mathematics of computing → Combinatoric problems
  • Mathematics of computing → Combinatorics
  • Mathematics of computing → Probabilistic algorithms
Keywords
  • random k-XORSAT
  • belief propagation
  • decimation process
  • random matrices

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We analyse the performance of Belief Propagation Guided Decimation, a physics-inspired message passing algorithm, on the random k-XORSAT problem. Specifically, we derive an explicit threshold up to which the algorithm succeeds with a strictly positive probability Ω(1) that we compute explicitly, but beyond which the algorithm with high probability fails to find a satisfying assignment. In addition, we analyse a thought experiment called the decimation process for which we identify a (non-) reconstruction and a condensation phase transition. The main results of the present work confirm physics predictions from [Ricci-Tersenghi and Semerjian: J. Stat. Mech. 2009] that link the phase transitions of the decimation process with the performance of the algorithm, and improve over partial results from a recent article [Yung: Proc. ICALP 2024].

Cite As Get BibTex

Arnab Chatterjee, Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien, and Gregory B. Sorkin. Belief Propagation Guided Decimation on Random k-XORSAT. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 47:1-47:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.47

Author Details

Arnab Chatterjee
  • Faculty of Computer Science, TU Dortmund, Germany
Amin Coja-Oghlan
  • Faculty of Computer Science, TU Dortmund, Germany
Mihyun Kang
  • Institute of Discrete Mathematics, TU Graz, Austria
Lena Krieg
  • Faculty of Computer Science, TU Dortmund, Germany
Maurice Rolvien
  • Department of Informatics, University of Hamburg, Germany
Gregory B. Sorkin
  • Department of Mathematics, The London School of Economics and Political Science, UK

Funding

  • Coja-Oghlan, Amin: supported by DFG CO 646/3, DFG CO 646/5 and DFG CO 646/6.
  • Kang, Mihyun: supported by Austrian Science Fund (FWF) 10.55776/I6502.
  • Krieg, Lena: supported by DFG CO 646/3.
  • Rolvien, Maurice: supported by DFG Research Group ADYN (FOR 2975) under grant DFG 411362735.

References

  1. Dimitris Achlioptas and Amin Coja-Oghlan. Algorithmic barriers from phase transitions. In Proc. 49th FOCS, pages 793-802, 2008. URL: https://doi.org/10.1109/FOCS.2008.11.
  2. Dimitris Achlioptas and Micheal Molloy. The solution space geometry of random linear equations. Random Structures & Algorithms, 46:197-231, 2015. URL: https://doi.org/10.1002/RSA.20494.
  3. Peter Ayre, Amin Coja-Oghlan, Pu Gao, and Noëla Müller. The satisfiability threshold for random linear equations. Combinatorica, 40:179-235, 2020. URL: https://doi.org/10.1007/S00493-019-3897-3.
  4. Béla Bollobás. Random Graphs. Cambridge University Press, 2001. Google Scholar
  5. Alfredo Braunstein, Marc Mézard, and Riccardo Zecchina. Survey propagation: An algorithm for satisfiability. Random Structures & Algorithms, 27:201-226, 2005. URL: https://doi.org/10.1002/RSA.20057.
  6. Amin Coja-Oghlan. A better algorithm for random k-sat. SIAM Journal on Computing, 39:2823-2864, 2010. URL: https://doi.org/10.1137/09076516X.
  7. Amin Coja-Oghlan. Belief propagation guided decimation fails on random formulas. Journal of the ACM, 63(49), 2017. URL: https://doi.org/10.1145/3005398.
  8. Amin Coja-Oghlan, Alperen A. Ergür, Pu Gao, Samuel Hetterich, and Maurice Rolvien. The rank of sparse random matrices. Random Structures & Algorithms, 62:68-130, 2023. URL: https://doi.org/10.1002/RSA.21085.
  9. Amin Coja-Oghlan and Angelica Pachon-Pinzon. The decimation process in random k-sat. SIAM Journal on Discrete Mathematics, 26:1471-1509, 2012. URL: https://doi.org/10.1137/110842867.
  10. Christophe Deroulers and Rémi Monasson. Criticality and universality in the unit-propagation search rule. European Physical Journal B., 49:339-369, 2006. Google Scholar
  11. Olivier Dubois and Jacques Mandler. The 3-xorsat threshold. In Proc. 43rd FOCS, pages 769-778, 2002. URL: https://doi.org/10.1109/SFCS.2002.1182002.
  12. Alan Frieze and Stephen Suen. Analysis of two simple heuristics on a random instance of k-sat. Journal of Algorithms, 20:312-355, 1996. URL: https://doi.org/10.1006/JAGM.1996.0016.
  13. David Gamarnik. The overlap gap property: a topological barrier to optimizing over random structures. Proceeding of the National Academy of Sciences, 118, 2021. Google Scholar
  14. Samuel Hetterich. Analysing survey propagation guided decimation on random formulas. In Proc. 43rd ICALP, number 65, 2016. Google Scholar
  15. Morteza Ibrahimi, Yash Kanoria, Matt Kraning, and Andrea Montanari. The set of solutions of random xorsat formulae. Annals of Applied Probability, 25:2743-2808, 2015. Google Scholar
  16. Florent Krzakala, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, and Lenka Zdeborová. Gibbs states and the set of solutions of random constraint satisfaction problems. Proceeding of the National Academy of Sciences, 104:10318-10323, 2007. URL: https://doi.org/10.1073/PNAS.0703685104.
  17. Aude Maier, Freya Behrens, and Lenka Zdeborová. Dynamical cavity method for hypergraphs and its application to quenches in the k-xorsat problem, 2024. URL: https://arxiv.org/abs/2412.14794.
  18. Marc Mézard and Andrea Montanari. Information, Physics and Computation. Oxford University Press, 2009. Google Scholar
  19. Marc Mézard, Thierry Mora, and Riccardo Zecchina. Clustering of solutions in the random satisfiability problem. Physical Review Letters, 94, 2005. Google Scholar
  20. Marc Mézard, Giorgio Parisi, and Riccardo Zecchina. Analytic and algorithmic solution of random satisfiability problems. Science, 297:812-815, 2002. Google Scholar
  21. Marc Mézard, Federico Ricci-Tersenghi, and Riccardo Zecchina. Two solutions to diluted p-spin models and xorsat problems. Journal of Statistical Physics, 111:505-533, 2003. Google Scholar
  22. Michael Molloy. Cores in random hypergraphs and boolean formulas. Random Structures & Algorithms, 27:124-135, 2005. URL: https://doi.org/10.1002/RSA.20061.
  23. Boris Pittel and Gregory B. Sorkin. The satisfiability threshold for k-xorsat. Combinatorics, Probability and Computing, 25:236-268, 2016. URL: https://doi.org/10.1017/S0963548315000097.
  24. Federico Ricci-Tersenghi and Guilhem Semerjian. On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms. Journal of Statistical Mechanics, 2009. Google Scholar
  25. Kingsley Yung. Limits of sequential local algorithms on the random k-xorsat problem. In Proc. 51st ICALP, number 123, 2024. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact