Reconstruction Threshold for the Hardcore Model

13 years 5 months ago

Download www.crm.es

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

Nayantara Bhatnagar, Allan Sly, Prasad Tetali

Real-time Traffic

Algorithms | APPROX 2010 | Hardcore Model | Reconstruction Problem | Tree |

claim paper

» Genetic algorithms for 3d reconstruction with supershapes

» Embedded Voxel Colouring

» Threshold Schemes with Disenrollment

» Reconstruction of 3D Structures from Protein Contact Maps

» A quantization method based on threshold optimization for microarray short time series

» Shape modeling and clustering of white matter fiber tracts using fourier descriptors

» Random Sampling of Sparse Trigonometric Polynomials II Orthogonal Matching Pursuit versus ...

» Reconstructing networks of pathways via significance analysis of their intersections

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Nayantara Bhatnagar, Allan Sly, Prasad Tetali

Comments (0)

Sciweavers

Reconstruction Threshold for the Hardcore Model

Algorithms | APPROX 2010 | Hardcore Model | Reconstruction Problem | Tree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers