Random Bichromatic Matchings

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.

[1]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[2]  M. Jerrum.  Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .

[3]  M. Fisher.  Statistical Mechanics of Dimers on a Plane Lattice , 1961 .

[4]  O. J. Heilmann,et al.  Theory of monomer-dimer systems , 1972 .

[5]  A. Sinclair,et al.  Approximating the number of monomer-dimer coverings of a lattice , 1996 .

[6]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[7]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[8]  P. W. Kasteleyn.  The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[9]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[10]  Katta G. Murty,et al.  Matchings in colored bipartite networks , 2002, Discret. Appl. Math..

[11]  P. W. Kasteleyn.  The Statistics of Dimers on a Lattice , 1961 .

[12]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[13]  R. Fowler,et al.  An attempt to extend the statistical theory of perfect solutions , 1937 .

[14]  R. Pemantle,et al.  Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances , 1993, math/0404048.

[15]  V. Rich.  Personal communication , 1989, Nature.

[16]  A. V. Karzanov.  Maximum matching of given weight in complete and complete bipartite graphs , 1987 .

[17]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

[18]  Christos H. Papadimitriou,et al.  Polytopes and Complexity , 1984 .