skip to main content
research-article

The Complexity of Approximately Counting Tree Homomorphisms

Published:01 May 2014Publication History
Skip Abstract Section

Abstract

We study two computational problems, parameterised by a fixed tree H. #HOMSTO(H) is the problem of counting homomorphisms from an input graph G to H. #WHOMSTO(H) is the problem of counting weighted homomorphisms to H, given an input graph G and a weight function for each vertex v of G. Even though H is a tree, these problems turn out to be sufficiently rich to capture all of the known approximation behaviour in #P. We give a complete trichotomy for #WHOMSTO(H). If H is a star, then #WHOMSTO(H) is in FP. If H is not a star but it does not contain a certain induced subgraph J3, then #WHOMSTO(H) is equivalent under approximation-preserving (AP) reductions to #BIS, the problem of counting independent sets in a bipartite graph. This problem is complete for the class #RHΠ1 under AP-reductions. Finally, if H contains an induced J3, then #WHOMSTO(H) is equivalent under AP-reductions to #SAT, the problem of counting satisfying assignments to a CNF Boolean formula. Thus, #WHOMSTO(H) is complete for #P under AP-reductions. The results are similar for #HOMSTO(H) except that a rich structure emerges if H contains an induced J3. We show that there are trees H for which #HOMSTO(H) is #SAT-equivalent (disproving a plausible conjecture of Kelk). However, it is still not known whether #HOMSTO(H) is #SAT-hard for every tree H which contains an induced J3. It turns out that there is an interesting connection between these homomorphism-counting problems and the problem of approximating the partition function of the ferromagnetic Potts model. In particular, we show that for a family of graphs Jq, parameterised by a positive integer q, the problem #HOMSTO(Jq) is AP-interreducible with the problem of approximating the partition function of the q-state Potts model. It was not previously known that the Potts model had a homomorphism-counting interpretation. We use this connection to obtain some additional upper bounds for the approximation complexity of #HOMSTO(Jq).

References

  1. R. Balasubramanian and C. R. Subramanian. 2006. On sampling colorings of bipartite graphs. Disc. Math. Theor. Comput. Sci. 8, 1, 17--30 (electronic).Google ScholarGoogle Scholar
  2. Jørgen Bang-Jensen, Pavol Hell, and Gary MacGillivray. 1995. Hereditarily hard H-colouring problems. Disc. Math. 138, 1--3, 75--92. DOI:http://dx.doi.org/10.1016/0012-365X(94)00189-P. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Libor Barto, Marcin Kozik, and Todd Niven. 2009. The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM J. Comput. 38, 5, 1782--1802. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Christian Borgs, Jennifer T. Chayes, Martin Dyer, and Prasad Tetali. 2004. On the sampling problem for H-colorings on the hypercubic lattice. In Graphs, Morphisms and Statistical Physics, DIMACS Services in Discrete Mathematics and Theoretical Computer Science, vol. 63. American Mathematical Society, Providence, RI, 13--28.Google ScholarGoogle Scholar
  5. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, and Colin McQuillan. 2013. The expressibility of functions on the Boolean domain, with applications to Counting CSPs. J. ACM 60, 5. DOI:http://dx.doi.org/10.1145/2528401. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Colin Cooper, Martin Dyer, and Alan Frieze. 2001. On Markov chains for randomly H-coloring a graph. J. Algor. 39, 1, 117--134. DOI:http://dx.doi.org/10.1006/jagm.2000.1142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Pierluigi Crescenzi. 1997. A short guide to approximation preserving reductions. In Proceedings of the IEEE Conference on Computational Complexity. IEEE Computer Society, 262--273. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, and Mihalis Yannakakis. 1994. The complexity of multiterminal cuts. SIAM J. Comput. 23, 4, 864--894. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum. 2004. Counting and sampling H-colourings. Inf. Comput. 189, 1, 1--16. DOI:http://dx.doi.org/10.1016/j.ic.2003.09.001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, and Mark Jerrum. 2003. The relative complexity of approximate counting problems. Algorithmica 38, 3, 471--500.Google ScholarGoogle ScholarCross RefCross Ref
  11. Martin E. Dyer, Leslie Ann Goldberg, and Mark Jerrum. 2010. An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76, 3--4, 267--277. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Martin E. Dyer and Catherine S. Greenhill. 2000. The complexity of counting graph homomorphisms. Rand. Struct. Algor. 17, 3--4, 260--289. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Tomás Feder and Moshe Y. Vardi. 1998. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput. 28, 1, 57--104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. M. Fortuin and P. W. Kasteleyn. 1972. On the random-cluster model. I. Introduction and relation to other models. Physica 57, 536--564.Google ScholarGoogle ScholarCross RefCross Ref
  15. Leslie Ann Goldberg and Mark Jerrum. 2007. The complexity of ferromagnetic Ising with local fields. Combinat., Probability Comput. 16, 1, 43--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Leslie Ann Goldberg and Mark Jerrum. 2012. Approximating the partition function of the ferromagnetic Potts model. J. ACM 59, 5, 25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Leslie Ann Goldberg and Mark Jerrum. 2013. Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. J. Comput. System Sci. 79, 1, 68--78. DOI:http://dx.doi.org/10.1016/j.jcss.2012.04.005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Leslie Ann Goldberg, Steven Kelk, and Mike Paterson. 2004. The complexity of choosing an H-coloring (nearly) uniformly at random. SIAM J. Comput. 33, 2, 416--432. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Wolfgang Gutjahr, Emo Welzl, and Gerhard Woeginger. 1992. Polynomial graph-colorings. Disc. Appl. Math. 35, 1, 29--45. DOI:http://dx.doi.org/10.1016/0166-218X(92)90294-K. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Pavol Hell and Jaroslav Nešetřil. 1990. On the complexity of H-coloring. J. Comb. Theory, Ser. B 48, 1, 92--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Pavol Hell and Jaroslav Nešetřil. 2004. Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and its Applications, Vol. 28, Oxford University Press, Oxford, UK. DOI:http://dx.doi.org/10.1093/acprof:oso/9780198528173.001.0001.Google ScholarGoogle Scholar
  22. Pavol Hell and Jaroslav Nešetřil. 2008. Colouring, constraint satisfaction, and complexity. Comput. Sci. Rev. 2, 3, 143--163. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. P. Hell, J. Nešetřil, and X. Zhu. 1996. Complexity of tree homomorphisms. Discrete Appl. Math. 70, 1, 23--36. DOI:http://dx.doi.org/10.1016/0166-218X(96)00099-6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. F. Jaeger, D. L. Vertigan, and D. J. A. Welsh. 1990. On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108, 1, 35--53.Google ScholarGoogle ScholarCross RefCross Ref
  25. Mark Jerrum and Alistair Sinclair. 1993. Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput. 22, 5, 1087--1116. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Mark R. Jerrum, Leslie G. Valiant, and Vijay V. Vazirani. 1986. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 2--3, 169--188. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Steven Kelk. 2003. On the relative complexity of approximately counting H-colourings. Ph.D. Dissertation. Warwick University.Google ScholarGoogle Scholar
  28. Colin McQuillan. 2013. Computational complexity of approximation of partition functions. Ph.D. Dissertation. University of Liverpool.Google ScholarGoogle Scholar
  29. R. B. Potts. 1952. Some generalized order-disorder transformations. Proc. Cambridge Philos. Soc. 48, 106--109.Google ScholarGoogle ScholarCross RefCross Ref
  30. Alan Sokal. 2005. The multivariate Tutte polynomial. In Surveys in Combinatorics, Cambridge University Press, 173--226.Google ScholarGoogle Scholar
  31. David Zuckerman. 1996. On unapproximable versions of NP-Complete problems. SIAM J. Comput. 25, 6, 1293--1304. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The Complexity of Approximately Counting Tree Homomorphisms

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Computation Theory
          ACM Transactions on Computation Theory  Volume 6, Issue 2
          May 2014
          98 pages
          ISSN:1942-3454
          EISSN:1942-3462
          DOI:10.1145/2631196
          Issue’s Table of Contents

          Copyright © 2014 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 May 2014
          • Accepted: 1 March 2014
          • Revised: 1 February 2014
          • Received: 1 May 2013
          Published in toct Volume 6, Issue 2

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!