Abstract
We present fully polynomial time approximation schemesfor a broad class of Holant problems with complex edge weights, whichwe call Holant polynomials. We transform these problems into partitionfunctions of abstract combinatorial structures known as polymersin statistical physics. Our method involves establishing zero-free regionsfor the partition functions of polymer models and using the mostsignificant terms of the cluster expansion to approximate them.Results of our technique include new approximation and sampling algorithmsfor a diverse class of Holant polynomials in the low-temperatureregime (i.e. small external field) and approximation algorithms for generalHolant problems with small signature weights. Additionally, wegive randomised approximation and sampling algorithms with fasterrunning times for more restrictive classes. Finally, we improve theknown zero-free regions for a perfect matching polynomial.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.