Applications of Sinkhorn Balancingto Counting Problems
Isabel M. Beichl, F Sullivan
We describe a gneral 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.
Modern Analysis and Probability: Stochastic Processes and Functional Analysis, Conference ||| Marcel Dekker
November 1, 2002
Lecture Notes in Pure and Applied Mathematics
algorithms, graph theory, importance sampling, Monte Carlo methods, probability, sampling methods, stochastic matrices
and Sullivan, F.
Applications of Sinkhorn Balancingto Counting Problems, Modern Analysis and Probability: Stochastic Processes and Functional Analysis, Conference ||| Marcel Dekker
(Accessed November 30, 2023)