Reconstruction Threshold for the Hardcore Model

In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non-reconstruction when < (ln 2 - o(1)) ln2 k 2 ln ln k

• Type: Conference
• Year: 2010
• Where: APPROX
• Authors: Nayantara Bhatnagar, Allan Sly, Prasad Tetali
• Keywords: Algorithms, APPROX 2010, Hardcore Model, Reconstruction Problem, Tree