The Bradley--Terry condition is L1--testable
Abstract
We provide an algorithm with constant running time that given a weighted tournament T, distinguishes with high probability of success between the cases that T 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.