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 条
  • [1] Improved mixing condition on the grid for counting and sampling independent sets
    Ricardo Restrepo
    Jinwoo Shin
    Prasad Tetali
    Eric Vigoda
    Linji Yang
    Probability Theory and Related Fields, 2013, 156 : 75 - 99
  • [2] Improved mixing condition on the grid for counting and sampling independent sets
    Restrepo, Ricardo
    Shin, Jinwoo
    Tetali, Prasad
    Vigoda, Eric
    Yang, Linji
    PROBABILITY THEORY AND RELATED FIELDS, 2013, 156 (1-2) : 75 - 99
  • [3] A Novel Method for Counting Independent Sets in a Grid Graph
    De Ita Luna, Guillermo
    Vidal, Mireya Tovar
    Loranca, Beatriz Bernabe
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2023, 14 (01): : 11 - 18
  • [4] COUNTING MAXIMAL DISTANCE-INDEPENDENT SETS IN GRID GRAPHS
    Euler, Reinhardt
    Oleksik, Pawel
    Skupien, Zdzislaw
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (03) : 531 - 557
  • [5] Counting Rules for Computing the Number of Independent Sets of a Grid Graph
    De Ita Luna, Guillermo
    Bello Lopez, Pedro
    Marcial-Romero, Raymundo
    MATHEMATICS, 2024, 12 (06)
  • [6] Coupling with the stationary distribution and improved sampling for colorings and independent sets
    Hayes, Thomas P.
    Vigoda, Eric
    ANNALS OF APPLIED PROBABILITY, 2006, 16 (03): : 1297 - 1318
  • [7] Coupling with the Stationary Distribution and Improved Sampling for Colorings and Independent Sets
    Hayes, Tom
    Vigoda, Eric
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 971 - 979
  • [8] Counting Independent Sets in Hypergraphs
    Cooper, Jeff
    Dutta, Kunal
    Mubayi, Dhruv
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (04): : 539 - 550
  • [9] Counting independent sets in graphs
    Samotij, Wojciech
    EUROPEAN JOURNAL OF COMBINATORICS, 2015, 48 : 5 - 18
  • [10] Improved inapproximability results for counting independent sets in the hard-core model
    Galanis, Andreas
    Ge, Qi
    Stefankovic, Daniel
    Vigoda, Eric
    Yang, Linji
    RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (01) : 78 - 110