4 citations · 5 across the 10 of their papers we have counts for
10 papers
Strong Spatial Mixing for Binary Markov Random Fields
Jinshan Zhang, Heng Liang, Fengshan Bai
Gibbs distribution of binary Markov random fields on a sparse on average graph is considered in this paper. The strong spatial mixing is proved under the condition that the `extern…
Approximating Partition Functions of Two-State Spin Systems
Jinshan Zhang, Heng Liang, Fengshan Bai
Two-state spin systems is a classical topic in statistical physics. We consider the problem of computing the partition function of the systems on a bounded degree graph. Based on t…
Lecture notes on "Combinatorial Criteria for Uniqueness of Gibbs Measures"
Jinshan Zhang
These notes are dedicated to whom may be interested in algorithms, Markov chain, coupling, and graph theory etc. I present some preliminaries on coupling and explanations of the im…
An analysis of a random algorithm for estimating all the matchings
Jinshan Zhang
Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo,…
Improved Approximation for the Number of Hamiltonian Cycles in Dense Digraphs
Jinshan Zhang
We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is succes…
Strong Spatial Mixing and Approximating Partition Functions of Two-State Spin Systems without Hard Constrains
Jinshan Zhang
We prove Gibbs distribution of two-state spin systems(also known as binary Markov random fields) without hard constrains on a tree exhibits strong spatial mixing(also known as stro…