Random Sampling of Labeled Tournaments

This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given score vector. The proof uses the method of path coupling applied to an appropriate Markov chain on the set of labeled tournaments with the same score vector. MRS: 65C05, 05C20.

• Type: Journal
• Year: 2000
• Where: COMBINATORICS
• Authors: Lisa McShine
• Keywords: Appropriate Markov Chain, COMBINATORICS 2000, Labeled Tournaments, Score Vector