The Bradley--Terry condition is $L_1$--testable
Combinatorics
2016-09-19 v1
Abstract
We provide an algorithm with constant running time that given a weighted tournament , distinguishes with high probability of success between the cases that can be represented by a Bradley--Terry model, or cannot even be approximated by one. The same algorithm tests whether the corresponding Markov chain is reversible.
Keywords
Cite
@article{arxiv.1609.05194,
title = {The Bradley--Terry condition is $L_1$--testable},
author = {Agelos Georgakopoulos and Konstantinos Tyros},
journal= {arXiv preprint arXiv:1609.05194},
year = {2016}
}