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 条
  • [21] Counting independent sets in a tolerance graph
    Lin, Min-Sheng
    Su, Sheng-Huang
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 174 - 184
  • [22] Counting independent sets and maximal independent sets in some subclasses of bipartite graphs
    Lin, Min-Sheng
    DISCRETE APPLIED MATHEMATICS, 2018, 251 : 236 - 244
  • [23] Rapid mixing of hypergraph independent sets
    Hermon, Jonathan
    Sly, Allan
    Zhang, Yumeng
    RANDOM STRUCTURES & ALGORITHMS, 2019, 54 (04) : 730 - 767
  • [24] Counting the number of independent sets in chordal graphs
    Okamoto, Yoshio
    Uno, Takeaki
    Uehara, Ryuhei
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 229 - 242
  • [25] Counting independent sets in graphs of hyperplane arrangements
    Guo, Nicholas
    Yue, Guangyi
    DISCRETE MATHEMATICS, 2020, 343 (03)
  • [26] Inapproximability of counting independent sets in linear hypergraphs
    Qiu, Guoliang
    Wang, Jiaheng
    INFORMATION PROCESSING LETTERS, 2024, 184
  • [27] Counting weighted independent sets beyond the permanent
    DYER M.
    JERRUM M.
    MULLER H.
    VUSKOVIC K.
    1600, Society for Industrial and Applied Mathematics Publications (35): : 1503 - 1524
  • [28] COUNTING WEIGHTED INDEPENDENT SETS BEYOND THE PERMANENT
    Dyer, Martin
    Jerrum, Mark
    Muller, Haiko
    Vuskovic, Kristina
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (02) : 1503 - 1524
  • [29] Counting independent sets in unbalanced bipartite graphs
    Cannon, Sarah
    Perkins, Will
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1456 - 1466
  • [30] COUNTING INDEPENDENT SETS USING THE BETHE APPROXIMATION
    Chandrasekaran, Venkat
    Chertkov, Misha
    Gamarnik, David
    Shah, Devavrat
    Shin, Jinwoo
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 1012 - 1034