Fetching the paper…
Reading the bibliography…
We study an algorithm for approximating the multivariate independence polynomial $Z(\mathbf{z})$, with negative and complex arguments, an object that has strong connections to combinatorics and to statistical physics.
Statistical theory of equations of state and phase transitions. II. Lattice gas and Ising model
Lee, T. D., and Yang, C. N · 1952
Earlier work this paper cites.
Statistical theory of equations of state and phase transitions. I. Theory of condensation
Yang, C. N., and Lee, T. D · 1952
Earlier work this paper cites.
Percolation processes II. The connective constant
Hammersley, J. M · 1957
Earlier work this paper cites.
Problems and results on 3-chromatic hypergraphs and some related questions
Erdös, P., and Lovász, L · 1975
Earlier work this paper cites.
Asymptotic lower bounds for Ramsey functions
Spencer, J · 1977
Earlier work this paper cites.
The complexity of enumeration and reliability problems
Valiant, L. G · 1979
Earlier work this paper cites.
On a problem of Spencer
Shearer, J. B · 1985
Earlier work this paper cites.
A parallel algorithmic version of the local lemma
Alon, N · 1991
Earlier work this paper cites.
An algorithmic approach to the Lov’asz local lemma. I
Beck, J · 1991
Earlier work this paper cites.
Approximating the permanent of graphs with large factors
Dagum, P., and Luby, M · 1992
Earlier work this paper cites.
The Self-Avoiding Walk
Madras, N., and Slade, G · 1996
Earlier work this paper cites.
Transfer-matrix study of negative-fugacity singularity of hard-core lattice gas
Todo, S · 1999
Earlier work this paper cites.
The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma
Scott, A., and Sokal, A · 2004
Earlier work this paper cites.
Counting independent sets up to the tree threshold
Weitz, D · 2006
Earlier work this paper cites.
Simple Deterministic Approximation Algorithms for Counting Matchings
Bayati, M., Gamarnik, D., Katz, D., Nair, C., and Tetali, P · 2007
Earlier work this paper cites.
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
Gamarnik, D., and Katz, D · 2007
Earlier work this paper cites.
Improved algorithmic versions of the Lovász local lemma
Srinivasan, A · 2008
Earlier work this paper cites.
A constructive proof of the Lovász local lemma
Moser, R. A · 2009
Cited alongside, same era.
A constructive proof of the general Lovász Local Lemma
Moser, R., and Tardos, G · 2010
Cited alongside, same era.
Computational transition at the uniqueness threshold
Sly, A · 2010
Cited alongside, same era.
Moser and Tardos meet Lovász
Kolipaka, K., and Szegedy, M · 2011
Cited alongside, same era.
Improved mixing condition on the grid for counting and sampling independent sets
Restrepo, R., Shin, J., Tetali, P., Vigoda, E., and Yang, L · 2011
Cited alongside, same era.
Complexity of counting CSP with complex weights
Cai, J.-Y., and Chen, X · 2012
Cited alongside, same era.
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
Galanis, A., Štefankovič, D., and Vigoda, E · 2015
Later among the works it cites.
Algorithms and Generalizations for the Lovász Local Lemma
Harris, D. G · 2015
Later among the works it cites.
An algorithmic proof of the Lovász local lemma via resampling oracles
Harvey, N. J. A., and Vondrák, J · 2015
Later among the works it cites.
An algorithmic proof of the Lovász local lemma via resampling oracles, 2015
Harvey, N. J. A., and Vondrák, J · 2015
Later among the works it cites.
FPTAS for #BIS with Degree Bounds on One Side
Liu, J., and Lu, P · 2015
Later among the works it cites.
FPTAS for counting monotone CNF
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Duminil-Copin, H., and Smirnov, S · 2012
Cited alongside, same era.
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Sinclair, A., Srivastava, P., and Thurley, M · 2012
Cited alongside, same era.
Deterministic algorithms for the Lov’asz local lemma
Chandrasekaran, K., Goyal, N., and Haeupler, B · 2013
Cited alongside, same era.
Correlation decay up to uniqueness in spin systems
Li, L., Lu, P., and Yin, Y · 2013
Cited alongside, same era.
Spatial mixing and approximation algorithms for graphs with bounded connective constant
Sinclair, A., Srivastava, P., and Yin, Y · 2013
Cited alongside, same era.
Random walks that find perfect objects and the Lovász local lemma
Achlioptas, D., and Iliopoulos, F · 2014
Cited alongside, same era.
Liu, J., and Lu, P · 2015
Later among the works it cites.
Zero-free regions of partition functions with applications to algorithms and graph limits
Regts, G · 2015
Later among the works it cites.
Spatial mixing and the connective constant: Optimal bounds
Sinclair, A., Srivastava, P., Štefankovič, D., and Yin, Y · 2015
Later among the works it cites.
Approximating the hard core partition function with negative activities, Apr. 2015
Srivastava, P · 2015
Later among the works it cites.
Computing the partition function for graph homomorphisms
Barvinok, A., and Soberón, P · 2016
Closest in time.
Computing the partition function for graph homomorphisms with multiplicities
Barvinok, A., and Soberón, P · 2016
Closest in time.
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
Efthymiou, C., Hayes, T. P., Štefankovic, D., Vigoda, E., and Yin, Y · 2016
Closest in time.
Computing the independence polynomial in Shearer’s region for the LLL, Aug. 2016
Harvey, N. J. A., Srivastava, P., and Vondrák, J · 2016
Closest in time.
Holroyd, A. E., and Liggett, T. M · 2016
Closest in time.
Patel, V., and Regts, G · 2016
Closest in time.
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold
Galanis, A., Goldberg, L. A., and Stefankovic, D · 2017
Closest in time.