Phase transitions in sampling algorithms and the underlying random structures

DOI10.1007/978-3-642-13731-0_29zbMATH Open1285.68118OpenAlexW1560028702MaRDI QIDQ3569900FDOQ3569900

Authors: Dana Randall 

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_29

Recommendations

• On the hardness of sampling independent sets beyond the tree threshold
• On Markov Chains for Independent Sets
• Publication:4952677
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cited In (5)

• Sampling hierarchies of discrete random structures
• Elaborating transition interface sampling methods
• Population-induced phase transitions and the verification of chemical reaction networks
• Boltzmann Samplers, Pólya Theory, and Cycle Pointing
• Sampling the Fermi statistics and other conditional product measures

This page was built for publication: Phase transitions in sampling algorithms and the underlying random structures

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