Algorithmica

, Volume 50, Issue 4, pp 418–445

Random Bichromatic Matchings

Authors

    • College of ComputingGeorgia Institute of Technology
  • Dana Randall
    • College of ComputingGeorgia Institute of Technology
  • Vijay V. Vazirani
    • College of ComputingGeorgia Institute of Technology
  • Eric Vigoda
    • College of ComputingGeorgia Institute of Technology
Article

DOI: 10.1007/s00453-007-9096-4

Cite this article as:
Bhatnagar, N., Randall, D., Vazirani, V.V. et al. Algorithmica (2008) 50: 418. doi:10.1007/s00453-007-9096-4

Abstract

Given a graph with edges colored Red and Blue, we study the problem of sampling and approximately counting the number of matchings with exactly kRed edges. We solve the problem of estimating the number of perfect matchings with exactly kRed edges for dense graphs. We study a Markov chain on the space of all matchings of a graph that favors matchings with kRed edges. We show that it is rapidly mixing using non-traditional canonical paths that can backtrack. We show that this chain can be used to sample matchings in the 2-dimensional toroidal lattice of any fixed size with kRed edges, where the horizontal edges are Red and the vertical edges are Blue.

Keywords

Markov chainsMatchingsSamplingApproximate counting
Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2007