The Bradley-Terry condition is L1-testable.

Agelos Georgakopoulos,Konstantinos Tyros

Discrete Mathematics（2018）

引用 0|浏览1

暂无评分

摘要

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.

查看译文

关键词

Bradley–Terry model,Property testing, L1-tester,Reversible Markov chain,Stochastic tournament

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要