{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7620","name":"#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region","abstract":"Counting independent sets on bipartite graphs (#BIS) is considered a canonical counting problem of intermediate approximation complexity. It is conjectured that #BIS neither has an FPRAS nor is as hard as #SAT to approximate. We study #BIS in the general framework of two-state spin systems in bipartite graphs. Such a system is parameterized by three numbers (beta,gamma,lambda), where beta (respectively gamma) represents the weight of an edge (or \"interaction strength\") whose endpoints are of the same 0 (respectively 1) spin, and lambda is the weight of a 1 vertex, also known as an \"external field\". By convention, the edge weight with unequal 0\/1 end points and the vertex weight with spin 0 are both normalized to 1. The partition function of the special case beta=1, gamma=0, and lambda=1 counts the number of independent sets. We define two notions, nearly-independent phase-correlated spins and symmetry breaking. We prove that it is #BIS-hard to approximate the partition function of any two-spin system on bipartite graphs supporting these two notions.\r\n\r\nAs a consequence, we show that #BIS on graphs of degree at most 6 is as hard to approximate as #BIS~without degree bound. The degree bound 6 is the best possible as Weitz presented an FPTAS to count independent sets on graphs of maximum degree 5. This result extends to the hard-core model and to other anti-ferromagnetic two-spin models. In particular, for all antiferromagnetic two-spin systems, namely those satisfying beta*gamma<1, we prove that when the infinite (Delta-1)-ary tree lies in the non-uniqueness region then it is #BIS-hard to approximate the partition function on bipartite graphs of maximum degree Delta, except for the case beta=gamma and lambda=1. The exceptional case is precisely the antiferromagnetic Ising model without an external field, and we show that it has an FPRAS on bipartite graphs. Our inapproximability results match the approximability results of Li et al., who presented an FPTAS for general graphs of maximum degree Delta when the parameters lie in the uniqueness region.","keywords":["Spin systems","approximate counting","complexity","#BIS-hardness","phase transition"],"author":[{"@type":"Person","name":"Cai, Jin-Yi","givenName":"Jin-Yi","familyName":"Cai"},{"@type":"Person","name":"Galanis, Andreas","givenName":"Andreas","familyName":"Galanis"},{"@type":"Person","name":"Goldberg, Leslie Ann","givenName":"Leslie Ann","familyName":"Goldberg"},{"@type":"Person","name":"Guo, Heng","givenName":"Heng","familyName":"Guo"},{"@type":"Person","name":"Jerrum, Mark","givenName":"Mark","familyName":"Jerrum"},{"@type":"Person","name":"Stefankovic, Daniel","givenName":"Daniel","familyName":"Stefankovic"},{"@type":"Person","name":"Vigoda, Eric","givenName":"Eric","familyName":"Vigoda"}],"position":39,"pageStart":582,"pageEnd":595,"dateCreated":"2014-09-04","datePublished":"2014-09-04","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Cai, Jin-Yi","givenName":"Jin-Yi","familyName":"Cai"},{"@type":"Person","name":"Galanis, Andreas","givenName":"Andreas","familyName":"Galanis"},{"@type":"Person","name":"Goldberg, Leslie Ann","givenName":"Leslie Ann","familyName":"Goldberg"},{"@type":"Person","name":"Guo, Heng","givenName":"Heng","familyName":"Guo"},{"@type":"Person","name":"Jerrum, Mark","givenName":"Mark","familyName":"Jerrum"},{"@type":"Person","name":"Stefankovic, Daniel","givenName":"Daniel","familyName":"Stefankovic"},{"@type":"Person","name":"Vigoda, Eric","givenName":"Eric","familyName":"Vigoda"}],"copyrightYear":"2014","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2014.582","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6231","volumeNumber":28,"name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014)","dateCreated":"2014-09-04","datePublished":"2014-09-04","editor":[{"@type":"Person","name":"Jansen, Klaus","givenName":"Klaus","familyName":"Jansen"},{"@type":"Person","name":"Rolim, Jos\u00e9","givenName":"Jos\u00e9","familyName":"Rolim"},{"@type":"Person","name":"Devanur, Nikhil R.","givenName":"Nikhil R.","familyName":"Devanur"},{"@type":"Person","name":"Moore, Cristopher","givenName":"Cristopher","familyName":"Moore"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7620","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6231"}}}