scholarly journals Improved inapproximability results for counting independent sets in the hard-core model

2012 ◽  
Vol 45 (1) ◽  
pp. 78-110 ◽  
Author(s):  
Andreas Galanis ◽  
Qi Ge ◽  
Daniel Štefankovič ◽  
Eric Vigoda ◽  
Linji Yang
2001 ◽  
Vol 10 (3) ◽  
pp. 219-237 ◽  
Author(s):  
JEFF KAHN

We use entropy ideas to study hard-core distributions on the independent sets of a finite, regular bipartite graph, specifically distributions according to which each independent set I is chosen with probability proportional to λ[mid ]I[mid ] for some fixed λ > 0. Among the results obtained are rather precise bounds on occupation probabilities; a ‘phase transition’ statement for Hamming cubes; and an exact upper bound on the number of independent sets in an n-regular bipartite graph on a given number of vertices.


2018 ◽  
Vol 174 (3-4) ◽  
pp. 1187-1217 ◽  
Author(s):  
Alexander E. Holroyd ◽  
Irène Marcovici ◽  
James B. Martin

1966 ◽  
Vol 45 (1) ◽  
pp. 378-383 ◽  
Author(s):  
Neil S. Snider
Keyword(s):  

2015 ◽  
Vol 109 (2) ◽  
pp. 20003
Author(s):  
Tommaso Comparin ◽  
Sebastian C. Kapfer ◽  
Werner Krauth

2002 ◽  
Vol 88 (4) ◽  
Author(s):  
Athanassios Z. Panagiotopoulos ◽  
Michael E. Fisher

2017 ◽  
Vol 62 ◽  
pp. 70-76 ◽  
Author(s):  
Emma Cohen ◽  
Péter Csikvári ◽  
Will Perkins ◽  
Prasad Tetali

2010 ◽  
Vol 82 (2) ◽  
Author(s):  
A. Winkler ◽  
G. Alsmeyer ◽  
O. Rubner ◽  
A. Heuer
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document