The Bradley-Terry condition is \(L_1\)-testable

DOI10.1016/j.disc.2017.10.026zbMath1380.05086arXiv1609.05194OpenAlexW2964247258MaRDI QIDQ1699573

Konstantinos Tyros, Angelos Georgakopoulos

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.05194

zbMATH Keywords

property testingBradley-Terry modelreversible Markov chain\(L_1\)-testerstochastic tournament

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Graph removal lemmas
• Property testing and its connection to learning and approximation
• Every Monotone Graph Property Is Testable
• Robust Characterizations of Polynomials with Applications to Program Testing
• A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
• L _p -testing
• Easily Testable Graph Properties
• Introduction to Property Testing
• Property testing in bounded degree graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Bradley-Terry condition is \(L_1\)-testable