FPRAS for the Potts Model and the Number of k-colorings

02/25/2019

∙

In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give FPRASes for the Potts model and the number of k-colorings of the graph.

READ FULL TEXT

FPRAS for the Potts Model and the Number of k-colorings

Jump Markov Chains and Rejection-Free Metropolis Algorithms

Irreducibility of Recombination Markov Chains in the Triangular Lattice

Learning Mixtures of Markov Chains with Quality Guarantees

Exploring TD error as a heuristic for σ selection in Q(σ, λ)

SMOTE-ENC: A novel SMOTE-based method to generate synthetic data for nominal and continuous features

Quickest Detection of Markov Networks

Exact Distributed Sampling

FPRAS for the Potts Model and the Number of k-colorings

Related Research

Jump Markov Chains and Rejection-Free Metropolis Algorithms

Irreducibility of Recombination Markov Chains in the Triangular Lattice

Learning Mixtures of Markov Chains with Quality Guarantees

Exploring TD error as a heuristic for σ selection in Q(σ, λ)

SMOTE-ENC: A novel SMOTE-based method to generate synthetic data for nominal and continuous features

Quickest Detection of Markov Networks

Exact Distributed Sampling