Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COMBINATORICS
2000

favoriteEmaildiscussreport

101views more COMBINATORICS 2000»

Random Sampling of Labeled Tournaments

13 years 4 months ago

Random Sampling of Labeled Tournaments

Download www.combinatorics.org

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.

Lisa McShine

Real-time Traffic

Appropriate Markov Chain | COMBINATORICS 2000 | Labeled Tournaments | Score Vector |

claim paper

Related Content

» A study of mutational robustness as the product of evolutionary computation

» PerturbandMAP Random Fields Using Discrete Optimizationto Learn and Sample from Energy Mod...

» Efficiently learning the accuracy of labeling sources for selective sampling

» Random Sampling Based SVM for Relevance Feedback Image Retrieval

» Selective Sampling Based on the Variation in Label Assignments

» Automatically Labeling Video Data Using Multiclass Active Learning

» Graph cuts optimization for multilimb human segmentation in depth maps

» Fast geometric point labeling using conditional random fields

» Multilabel Subspace Ensemble

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	COMBINATORICS
Authors	Lisa McShine

Comments (0)