Optimization on sparse random hypergraphs and spin glasses

DOI10.1002/RSA.20774zbMath1397.05121arXiv1606.02365OpenAlexW2963229940WikidataQ130120371 ScholiaQ130120371MaRDI QIDQ4961546

Subhabrata Sen

Publication date: 25 October 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.02365

zbMATH Keywords

optimizationspin glassbisectionXORSAT\(q\)-cut

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial optimization (90C27) Density (toughness, etc.) (05C42)

Related Items (5)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On the minimum bisection of random 3-regular graphs ⋮ A Friendly Tutorial on Mean-Field Spin Glass Techniques for Non-Physicists ⋮ Optimal couplings between sparse block models ⋮ On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model

This page was built for publication: Optimization on sparse random hypergraphs and spin glasses