Statistical ranking and combinatorial Hodge theory
From MaRDI portal
(Redirected from Publication:633110)
Recommendations
Cites work
- 10.1162/1532443041827916
- A Consistent Extension of Condorcet’s Election Principle
- A generalization of spectral analysis with application to ranked data
- A geometric examination of Kemeny's rule
- A scaling method for priorities in hierarchical structures
- Aggregating inconsistent information
- An Alternative Ranking Problem for Search Engines
- Authoritative sources in a hyperlinked environment
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- Classification by pairwise coupling
- Computing Betti numbers via combinatorial Laplacians
- Convex rank tests and semigraphoids
- Distributed Coverage Verification in Sensor Networks Without Location Information
- Empirical stationary correlations for semi-supervised learning on graphs
- Hodge theory on metric spaces. Appendix by Anthony W. Baker
- scientific article; zbMATH DE number 50740 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- scientific article; zbMATH DE number 3086523 (Why is no real title available?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
- ON THE METHOD OF PAIRED COMPARISONS
- Remarks about a paired comparison model
- Topology of random clique complexes
Cited in
(55)- Enumerating polytropes
- Simplicial networks and effective resistance
- Hodge decomposition and the Shapley value of a cooperative game
- Commutative algebra of statistical ranking
- Pairwise ranking: choice of method can produce arbitrarily different rank order
- Evaluating visual properties via robust HodgeRank
- The rankability of weighted data from pairwise comparisons
- Ranking with Hamiltonian dynamics
- Enforcing exact physics in scientific machine learning: a data-driven exterior calculus on graphs
- Dirichlet-to-Neumann maps for differential forms on graphs and their eigenvalues
- University rankings from the revealed preferences of the applicants
- The geometry of synchronization problems and learning group actions
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Deformed Laplacians and spectral ranking in directed networks
- A graph interpretation of the least squares ranking method
- Linear spectral sets and their extremal varieties
- Topological persistence for circle-valued maps
- HodgeRank is the limit of Perron Rank
- Computing a ranking network with confidence bounds from a graph-based beta random field
- Optimal data collection for informative rankings expose well-connected graphs
- Statistical ranking using the \(\ell^{1}\)-norm on graphs
- Hodge theory on metric spaces. Appendix by Anthony W. Baker
- A new and flexible approach to the analysis of paired comparison data
- (Quasi)periodicity quantification in video data, using topology
- A nonlocal vector calculus, nonlocal volume-constrained problems, and nonlocal balance laws
- Ranking and synchronization from pairwise measurements via SVD
- The rankability of data
- The network HHD: quantifying cyclic competition in trait-performance models of tournaments
- Decomposition of games: some strategic considerations
- Robust Learning of Consumer Preferences
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Hodge Laplacians on graphs
- Diffusion equations from master equations -- a discrete geometric approach
- Hodge decomposition of bitcoin money flow
- An adaptive multigrid method based on path cover
- Non-local Retinex -- a unifying framework and beyond
- scientific article; zbMATH DE number 7064064 (Why is no real title available?)
- Time-homogeneous top-\(K\) ranking using tensor decompositions
- Numerical methods for nonlocal and fractional models
- Harmonic representatives in homology over arbitrary fields
- Similarity Suppresses Cyclicity: Why Similar Competitors Form Hierarchies
- What Are Higher-Order Networks?
- scientific article; zbMATH DE number 7800538 (Why is no real title available?)
- Pairwise learning for personalized ranking with noisy comparisons
- Statistical ranking with dynamic covariates
- A graph discretization of vector Laplacian
- Intrinsic finite elements: currents, discrete geometry and periodic table
- Shared-endpoint correlations and hierarchy in random flows on graphs
- Fourth order random tensors and their applications in statistics
- Circular coordinates for density-robust analysis
- Global metabolic coherence as a derived property of microbial communities: a discrete Hodge framework
- Faster HodgeRank approximation algorithm for statistical ranking and user recommendation problems
- Multiscale Hodge scattering networks for data analysis
- Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs
- Hodge-Kodaira decomposition of evolving neural networks
This page was built for publication: Statistical ranking and combinatorial Hodge theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633110)
