Applications of Sinkhorn Balancing: The Monomer-Dimer Problem
Isabel M. Beichl, Francis Sullivan
We describe a general Monte Carlo technique based on work of Knuth for estimating the size of trees in backtrack algorithms. This method, based on importance sampling, is used to estimate the number of partial and complete matchings in a bipartite graph. Applications to the dimmer covering problem and the monomer-dimer problem are detailed.
Stochastic Processes and Functional Analyses
and Sullivan, F.
Applications of Sinkhorn Balancing: The Monomer-Dimer Problem, Stochastic Processes and Functional Analyses
(Accessed December 4, 2023)