A General Pairwise Comparison Model for Extremely Sparse Networks
From MaRDI portal
Abstract: Statistical inference using pairwise comparison data is an effective approach to analyzing large-scale sparse networks. In this paper, we propose a general framework to model the mutual interactions in a network, which enjoys ample flexibility in terms of model parametrization. Under this setup, we show that the maximum likelihood estimator for the latent score vector of the subjects is uniformly consistent under a near-minimal condition on network sparsity. This condition is sharp in terms of the leading order asymptotics describing the sparsity. Our analysis utilizes a novel chaining technique and illustrates an important connection between graph topology and model consistency. Our results guarantee that the maximum likelihood estimator is justified for estimation in large-scale pairwise comparison networks where data are asymptotically deficient. Simulation studies are provided in support of our theoretical findings.
Cites work
- A continuum of paired comparisons models
- A paired comparison approach for the analysis of sets of Likert-scale responses
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Analysis of Ordinal Paired Comparison Data
- Asymptotic theory of sparse Bradley-Terry model
- Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
- Binary choice probabilities: on the varieties of stochastic transitivity
- Estimation from pairwise comparisons: sharp minimax bounds with topology dependence
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 41025 (Why is no real title available?)
- scientific article; zbMATH DE number 882706 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- Limited information estimation and testing of Thurstonian models for paired comparison data under multiple judgment sampling
- Limited information estimation and testing of Thurstonian models for preference data
- MM algorithms for generalized Bradley-Terry models.
- Models for paired comparison data: a review with emphasis on dependent data
- Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method
- Rank Centrality: Ranking from Pairwise Comparisons
- Solution of a Ranking Problem from Binary Comparisons
- Sparse paired comparisons in the Bradley-Terry model
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
Cited in
(8)- Analysis of Networks via the Sparseβ-model
- Statistical ranking with dynamic covariates
- A two-way heterogeneity model for dynamic networks
- A unified analysis of likelihood-based estimators in the Plackett-Luce model
- Least squares for cardinal paired comparisons data
- Evaluability of paired comparison data in stochastic paired comparison models: necessary and sufficient condition
- Convergence analysis of a family of Zermelo-type iterations for the Bradley--Terry model
- Random Pairing MLE for Estimation of Item Parameters in Rasch Model
This page was built for publication: A General Pairwise Comparison Model for Extremely Sparse Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144758)
