Fast sampling via spectral independence beyond bounded-degree graphs

DOI10.4230/LIPICS.ICALP.2022.21MaRDI QIDQ6560807zbMATH OpenFDO

Authors Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, D. Štefankovič

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.21

zbMATH Keywords

hard-core modelMarkov chainsrandom graphs

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Rapid Mixing from Spectral Independence beyond the Boolean Domain
• Fast convergence of the Glauber dynamics for sampling independent sets
• Rapid mixing from spectral independence beyond the Boolean domain
• Spectral independence in high-dimensional expanders and applications to the hardcore model

Cited in

(1)

• Fast sampling of satisfying assignments from random k-SAT with applications to connectivity

This page was built for publication: Fast sampling via spectral independence beyond bounded-degree graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560807)