20 citations · 24 across the 6 of their papers we have counts for
6 papers
A load balancing strategy for parallel computation of sparse permanents
Lei Wang, Heng Liang, Fengshan Bai +1
The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-incr…
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…
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,…
An analysis of a random algorithm for estimating all the matchings
Jinshan Zhang, Yan Huo, Fengshan Bai
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,…
Approximating the monomer-dimer constants through matrix permanent
Yan Huo, Heng Liang, Si-Qi Liu +1
The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent f…