Statistical ranking using the ^1-norm on graphs

DOI10.3934/IPI.2013.7.907MaRDI QIDQ371094zbMATH OpenOpenAlexFDO

Authors Braxton Osting, Jérôme Darbon, Stanley Osher

Publication date 27 September 2013

Published in Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/ipi.2013.7.907

zbMATH Keywords

\(\ell^{1}\)-norm minimizationgraph-cut methodHodgeRankKemeny-Snell orderingrank aggregationstatistical ranking

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Discrete potential theory (31C20) Statistical ranking and selection procedures (62F07) Iterative numerical methods for linear systems (65F10)

Recommendations

• Statistical ranking and combinatorial Hodge theory
• Rank Centrality: Ranking from Pairwise Comparisons
• A graph interpretation of the least squares ranking method
• Optimal data collection for informative rankings expose well-connected graphs
• Pairwise ranking: choice of method can produce arbitrarily different rank order

Cited in

(10)

• Evaluating visual properties via robust HodgeRank
• Deformed Laplacians and spectral ranking in directed networks
• A graph interpretation of the least squares ranking method
• HodgeRank is the limit of Perron Rank
• Optimal data collection for informative rankings expose well-connected graphs
• Hodge Laplacians on graphs
• Non-local Retinex -- a unifying framework and beyond
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Statistical ranking and combinatorial Hodge theory
• Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs

This page was built for publication: Statistical ranking using the \(\ell^{1}\)-norm on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371094)