Computing a ranking network with confidence bounds from a graph-based Beta random field

DOI10.1098/RSPA.2011.0268zbMath1243.91040OpenAlexW2118474754WikidataQ51480909 ScholiaQ51480909MaRDI QIDQ2901822

Hsieh Fushing, Brenda McCowan, Michael P. McAssey

Publication date: 31 July 2012

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rspa.2011.0268

zbMATH Keywords

paired comparisoninformation transitivitybeta random fieldnonlinear ranking hierarchyrhesus macaque

Mathematics Subject Classification ID

Random fields; image analysis (62M40) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Social choice (91B14)

Cites Work

• Optimization by Simulated Annealing
• A Bayesian approach to paired comparison experimentation

This page was built for publication: Computing a ranking network with confidence bounds from a graph-based Beta random field