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 条
  • [31] Counting Maximal Independent Sets in Subcubic Graphs
    Junosza-Szaniawski, Konstanty
    Tuczynski, Michal
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 325 - 336
  • [32] Maximal independent sets on a grid graph
    Oh, Seungsang
    DISCRETE MATHEMATICS, 2017, 340 (12) : 2762 - 2768
  • [33] The number of independent sets in a grid graph
    Calkin, NJ
    Wilf, HS
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) : 54 - 60
  • [34] Counting independent dominating sets in linear polymers
    Alikhani, Saeid
    Jahari, Somayeh
    ADVANCED STUDIES-EURO-TBILISI MATHEMATICAL JOURNAL, 2023, 16 : 47 - 57
  • [35] Counting independent sets in unbalanced bipartite graphs
    Cannon, Sarah
    Perkins, Will
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1456 - 1466
  • [36] Maximal independent sets in grid graphs
    Ortiz, Carmen
    Villanueva, Monica
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (1-2) : 369 - 385
  • [37] A faster method for sampling independent sets
    Huber, M
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 625 - 626
  • [38] Sampling independent sets in the discrete torus
    Galvin, David
    RANDOM STRUCTURES & ALGORITHMS, 2008, 33 (03) : 356 - 376
  • [39] Counting maximal independent sets in directed path graphs
    Lin, Min-Sheng
    Su, Sheng-Huang
    INFORMATION PROCESSING LETTERS, 2014, 114 (10) : 568 - 572
  • [40] Counting independent sets in cubic graphs of given girth
    Perarnau, Guillem
    Perkins, Will
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 133 : 211 - 242