Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the algorithm exploits the ‘winding’ technology devised by McQuillan [CoRR abs/1301.2880 (2013)] and developed by Huang, Lu and Zhang [Proc. 27th Symp. on Disc. Algorithms (SODA16), 514–527]. We show that exact computation of the partition function is #P-hard, even for line graphs, indicating that an approximation algorithm is the best that can be expected. We also show that Glauber dynamics for the Ising model is rapidly mixing on line graphs, an example being the kagome lattice.

[1]  E. Jurčišinová,et al.  Ground states, residual entropies, and specific heat capacity properties of frustrated Ising system on pyrochlore lattice in effective field theory cluster approximations , 2020 .

[2]  Eric Vigoda,et al.  Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[3]  Xi Chen,et al.  Complexity Dichotomies for Counting Problems by Jin-Yi Cai , 2017 .

[4]  Pinyan Lu,et al.  Canonical Paths for MCMC: from Art to Science , 2015, SODA.

[5]  Jin-Yi Cai,et al.  Holant Problems for 3-Regular Graphs with Complex Edge Functions , 2016, Theory of Computing Systems.

[6]  Colin McQuillan.  Approximating Holant problems by winding , 2013, ArXiv.

[7]  Jin-Yi Cai,et al.  From Holant to #CSP and Back: Dichotomy for Holantc Problems , 2012, Algorithmica.

[8]  Pinyan Lu,et al.  Complexity Dichotomies of Counting Problems , 2011, Electron. Colloquium Comput. Complex..

[9]  Michael I. Jordan,et al.  Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..

[10]  Eric Vigoda,et al.  Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2006, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[11]  Leslie Ann Goldberg,et al.  Random sampling of 3-colorings in Z2 , 2004, Random Struct. Algorithms.

[12]  M. Jerrum.  Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .

[13]  Klaus Jansen,et al.  On the Complexity of the Maximum Cut Problem , 1994, Nord. J. Comput..

[14]  M. Luby,et al.  Fast convergence of the Glauber dynamics for sampling independent sets , 1999, Random Struct. Algorithms.

[15]  Venkatesan Guruswami.  Maximum Cut on Line and Total Graphs , 1999, Discret. Appl. Math..

[16]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[17]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[18]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[19]  Claudio Arbib,et al.  A Polynomial Characterization of Some Graph Partitioning Problems , 1988, Inf. Process. Lett..

[20]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[21]  S. Miracle-Sole,et al.  Statistical mechanics of lattice systems , 1967 .

[22]  M. Fisher.  On the Dimer Solution of Planar Ising Models , 1966 .

[23]  P. W. Kasteleyn.  Dimer Statistics and Phase Transitions , 1963 .

[24]  Itiro Syozi,et al.  Statistics of Kagomé Lattice , 1951 .