Abstract
Let be an independent set drawn from the discrete -dimensional hypercube according to the hard-core distribution with parameter (that is, the distribution in which each independent set is chosen with probability proportional to ). We show a sharp transition around in the appearance of : for , asymptotically almost surely, where and are the bipartition classes of , whereas for , is asymptotically almost surely exponential in . The transition occurs in an interval whose length is of order . A key step in the proof is an estimation of , the sum over independent sets in with each set given weight (a.k.a. the hard-core partition function). We obtain the asymptotics of for , and nearly matching upper and lower bounds for , extending work of Korshunov and Sapozhenko. These bounds allow us to read off some very specific information about the structure of an independent set drawn according to the hard-core distribution. We also derive a long-range influence result. For all fixed , if is chosen from the independent sets of according to the hard-core distribution with parameter , conditioned on a particular being in , then the probability that another vertex is in is for but for .
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.