Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets

被引:4
|
作者
Restrepo, Ricardo [1 ]
Shin, Jinwoo [2 ]
Tetali, Prasad [1 ]
Vigoda, Eric [2 ]
机构
[1] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA
[2] Georgia Inst Technol, Sch Comp Sci, Atlanta, GA 30332 USA
关键词
ONE-PHASE REGION; HARD-CORE; GLAUBER DYNAMICS; LATTICE; EQUILIBRIUM; PERCOLATION; COMPLEXITY;
D O I
10.1109/FOCS.2011.45
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The hard-core model has received much attention in the past couple of decades as a lattice gas model with hard constraints in statistical physics, a multicast model of calls in communication networks, and as a weighted independent set problem in combinatorics, probability and theoretical computer science. In this model, each independent set I in a graph G is weighted proportionally to lambda(vertical bar I vertical bar), for a positive real parameter lambda. For large lambda, computing the partition function (namely, the normalizing constant which makes the weighting a probability distribution on a finite graph) on graphs of maximum degree Delta >= 3, is a well known computationally challenging . More concretely, let lambda(c) (T-Delta) denote the critical value for the so-called uniqueness threshold of the hard-core model on the infinite Delta-regular tree; recent breakthrough results of Dror Weitz (2006) and Allan Sly (2010) have identified lambda(c) (T-Delta) as a threshold where the hardness of estimating the above partition function undergoes a computational transition. We focus on the well-studied particular case of the square lattice Z(2), and provide a new lower bound for the uniqueness threshold, in particular taking it well above lambda(c) (T-4). Our technique refines and builds on the tree of self-avoiding walks approach of Weitz, resulting in a new technical sufficient criterion (of wider applicability) for establishing strong spatial mixing (and hence uniqueness) for the hard-core model. Our new criterion achieves better bounds on strong spatial mixing when the graph has extra structure, improving upon what can be achieved by just using the maximum degree. Applying our technique to Z(2) we prove that strong spatial mixing holds for all lambda < 2.3882, improving upon the work of Weitz that held for lambda < 27/16 = 1.6875. Our results imply a fully-polynomial deterministic approximation algorithm for estimating the partition function, as well as rapid mixing of the associated Glauber dynamics to sample from the hard-core distribution.
引用
收藏
页码:140 / 149
页数:10
相关论文
共 50 条
  • [41] Counting independent sets in graphs with bounded bipartite pathwidth
    Dyer, Martin
    Greenhill, Catherine
    Muller, Haiko
    RANDOM STRUCTURES & ALGORITHMS, 2021, 59 (02) : 204 - 237
  • [42] A family of metrics for biopolymers based on counting independent sets
    Rocha, J
    Llabrés, M
    Alberich, R
    COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2005, 29 (05) : 337 - 344
  • [43] Efficient Counting of the Number of Independent Sets on Polygonal Trees
    De Ita, Guillermo
    Bello, Pedro
    Contreras, Meliza
    Catana-Salazar, Juan C.
    PATTERN RECOGNITION (MCPR 2016), 2016, 9703 : 167 - 176
  • [44] COUNTING INDEPENDENT SETS IN TRIANGLE-FREE GRAPHS
    Cooper, Jeff
    Mubayi, Dhruv
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2014, 142 (10) : 3325 - 3334
  • [45] Counting Hexagonal Patches and Independent Sets in Circle Graphs
    Bonsma, Paul
    Breuer, Felix
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 603 - +
  • [46] Exponential Time Complexity of Weighted Counting of Independent Sets
    Hoffmann, Christian
    PARAMETERIZED AND EXACT COMPUTATION, 2010, 6478 : 180 - 191
  • [47] Counting Hexagonal Patches and Independent Sets in Circle Graphs
    Paul Bonsma
    Felix Breuer
    Algorithmica, 2012, 63 : 645 - 671
  • [48] Counting Hexagonal Patches and Independent Sets in Circle Graphs
    Bonsma, Paul
    Breuer, Felix
    ALGORITHMICA, 2012, 63 (03) : 645 - 671
  • [49] Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
    Dyer, Martin
    Greenhill, Catherine
    Mueller, Haiko
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 298 - 310
  • [50] Counting Independent Sets in Claw-Free Graphs
    Junosza-Szaniawski, Konstanty
    Lonc, Zbigniew
    Tuczynski, Michal
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011, 6986 : 227 - 237