论文信息 - Uniqueness thresholds on trees versus graphs.

Uniqueness thresholds on trees versus graphs.

Counter to the general notion that the regular tree is the worst case for decay of correlation between sets and nodes, we produce an example of a multi-spin interacting system which has uniqueness on the $d$-regular tree but does not have uniqueness on some infinite $d$-regular graphs.

Allan Sly | A. Sly

[1] Leslie Ann Goldberg,et al. Strong spatial mixing for lattice graphs with fewer colours , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[2] Dror Weitz,et al. Counting independent sets up to the tree threshold , 2006, STOC '06.

[3] Alan D. Sokal. A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models , 2000 .

[4] Martin E. Dyer,et al. Mixing in time and space for lattice spin systems: A combinatorial view , 2002, International Workshop Randomization and Approximation Techniques in Computer Science.

[5] Olle Häggström,et al. Nonmonotonic Behavior in Hard-Core and Widom–Rowlinson Models , 1999 .

[6] F. Martinelli. Lectures on Glauber dynamics for discrete spin models , 1999 .

[7] A. Scott,et al. The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma , 2003, cond-mat/0309352.

[8] D. Shah,et al. Inference in Binary Pair-wise Markov Random Fields through Self-Avoiding Walks , 2006 .

[9] David Gamarnik,et al. Counting without sampling: new algorithms for enumeration problems using statistical physics , 2006, SODA '06.