1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      FPRAS for the Potts Model and the Number of \(k\)-colorings

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give \emph{FPRAS}es for the Potts model and the number of \(k\)-colorings of the graph.

          Related collections

          Most cited references23

          • Record: found
          • Abstract: not found
          • Article: not found

          Random generation of combinatorial structures from a uniform distribution

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Polynomial-Time Approximation Algorithms for the Ising Model

                Bookmark

                Author and article information

                Journal
                25 February 2019
                Article
                1902.09114
                22317c62-650d-4264-8f21-ae6651af3a77

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                cs.DS cs.CC math.CO

                Combinatorics,Theoretical computer science,Data structures & Algorithms
                Combinatorics, Theoretical computer science, Data structures & Algorithms

                Comments

                Comment on this article