Reconstruction Threshold for the Hardcore Model

DOI10.1007/978-3-642-15369-3_33zbMath1305.05148arXiv1004.3531OpenAlexW2036274644MaRDI QIDQ3588426

Nayantara Bhatnagar, Allan Sly, Prasad Tetali

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees ⋮ The asymptotics of the clustering transition for random constraint satisfaction problems ⋮ Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems ⋮ Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree

This page was built for publication: Reconstruction Threshold for the Hardcore Model