Abstract
We construct stable configurations of n overlapping discs of radius r in a unit square, with r = O(1/n). By a result of Diaconis, Lebeau, and Michel, this result is best possible, up to a constant factor. A consequence is that the Metropolis algorithm, a well-studied Markov chain on the hardcore model, is not irreducible in this range of parameters.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.