Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs

DOI10.1016/j.acha.2016.03.007zbMath1360.94503arXiv1503.00164OpenAlexW1480348078WikidataQ114388227 ScholiaQ114388227MaRDI QIDQ739476

Braxton Osting, Jiechao Xiong, Qianqian Xu, Yuan Yao

Publication date: 18 August 2016

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00164

zbMATH Keywords

algebraic connectivitycrowdsourcingErdös-Rényi random graphpaired comparison

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Random graphs (graph-theoretic aspects) (05C80) Applications of graph theory to circuits and networks (94C15)

Related Items

Deformed Laplacians and spectral ranking in directed networks

Uses Software

• iCoseg

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical ranking using the \(\ell^{1}\)-norm on graphs
• Statistical ranking and combinatorial Hodge theory
• A mathematical introduction to fluid mechanics
• Convex Hodge decomposition and regularization of image flows
• Topology of random clique complexes
• A scaling method for priorities in hierarchical structures
• Flows and Decompositions of Games: Harmonic and Potential Games
• Spectral techniques applied to sparse random graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
• ON THE METHOD OF PAIRED COMPARISONS