Fetching the paper…
Reading the bibliography…
We study the problem of approximate ranking from observations of pairwise interactions.
The transformation of poisson, binomial and negative-binomial data
Francis J Anscombe · 1948
Earlier work this paper cites.
Rank analysis of incomplete block designs: I. the method of paired comparisons
Ralph Allan Bradley and Milton E Terry · 1952
Earlier work this paper cites.
Weak convergence
Aad W Van Der Vaart and Jon A Wellner · 1996
Earlier work this paper cites.
Assouad, fano, and le cam
Bin Yu · 1997
Earlier work this paper cites.
Latent space approaches to social network analysis
Peter D Hoff, Adrian E Raftery, and Mark S Handcock · 2002
Earlier work this paper cites.
Individual choice behavior: A theoretical analysis
R Duncan Luce · 2005
Earlier work this paper cites.
Concentration inequalities and model selection , volume 1896
Pascal Massart · 2007
Earlier work this paper cites.
Noisy sorting without resampling
Mark Braverman and Elchanan Mossel · 2008
Earlier work this paper cites.
A path following algorithm for the graph matching problem
Mikhail Zaslavskiy, Francis Bach, and Jean-Philippe Vert · 2009
Cited alongside, same era.
Generalized distances between rankings
Ravi Kumar and Sergei Vassilvitskii · 2010
Cited alongside, same era.
A tail inequality for quadratic forms of subgaussian random vectors
Daniel Hsu, Sham Kakade, and Tong Zhang · 2012
Cited alongside, same era.
The graph isomorphism problem: its structural complexity
Johannes Kobler, Uwe Schöning, and Jacobo Torán · 2012
Cited alongside, same era.
Iterative ranking from pair-wise comparisons
Sahand Negahban, Sewoong Oh, and Devavrat Shah · 2012
Cited alongside, same era.
Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors
Victor Chernozhukov, Denis Chetverikov, and Kengo Kato · 2013
Cited alongside, same era.
Rate-optimal graphon estimation
Chao Gao, Yu Lu, and Harrison H Zhou · 2015
Later among the works it cites.
Simple, robust and optimal ranking from pairwise comparisons
Nihar B Shah and Martin J Wainwright · 2015
Later among the works it cites.
Information recovery from pairwise measurements
Yuxin Chen, Changho Suh, and Andrea J Goldsmith · 2016
Later among the works it cites.
Minimax rates in permutation estimation for feature matching
Olivier Collier and Arnak S Dalalyan · 2016
Later among the works it cites.
Stochastically transitive models for pairwise comparisons: Statistical and computational issues
Nihar Shah, Sivaraman Balakrishnan, Aditya Guntuboyina, and Martin Wainwright · 2016
Later among the works it cites.
Minimax rates of community detection in stochastic block models
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bounding the maximum of dependent random variables
JA Hartigan · 2013
Cited alongside, same era.
Anderson Y Zhang and Harrison H Zhou · 2016
Later among the works it cites.
Minimax rates and efficient algorithms for noisy sorting
Cheng Mao, Jonathan Weed, and Philippe Rigollet · 2017
Closest in time.