Corpus ID: 215828236

The complexity of approximating averages on bounded-degree graphs

@article{Galanis2020TheCO,
  title={The complexity of approximating averages on bounded-degree graphs},
  author={Andreas Galanis and Daniel Stefankovic and Eric Vigoda},
  journal={ArXiv},
  year={2020},
  volume={abs/2004.09238}
}
  • Andreas Galanis, Daniel Stefankovic, Eric Vigoda
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for the hard-core model defined on independent sets weighted by a parameter $\lambda>0$. In the general setting, we prove that, unless P=NP, for all $\Delta\geq 3$, all $\lambda>\lambda_c(\Delta)$, there is no FPTAS which applies to all graphs of maximum degree… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 20 REFERENCES
    On a conjecture of Sokal concerning roots of the independence polynomial
    38
    Counting independent sets up to the tree threshold
    • D. Weitz
    • Computer Science, Mathematics
    • 2006
    326
    Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
    73
    Computational Transition at the Uniqueness Threshold
    150
    Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
    9
    Approximation Algorithms for Two-State Anti-Ferromagnetic Spin Systems on Bounded Degree Graphs
    106
    Symbolic Integration and the Complexity of Computing Averages
    3
    Correlation Decay up to Uniqueness in Spin Systems
    94
    Inapproximability of the independent set polynomial in the complex plane
    13
    Polynomial-Time Approximation Algorithms for the Ising Model
    489