On the exponential ranking and its linear counterpart

DOI10.1007/978-3-030-93409-5_22MaRDI QIDQ2086597zbMATH OpenOpenAlexFDO

Authors Dmitry Gromov, Elizaveta Evmenova

Publication date 25 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-93409-5_22

zbMATH Keywords

Kendall's taurankingrank correlationsigned networksexponential ranking

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nonnumerical algorithms (68W05) Signed and weighted graphs (05C22)

Recommendations

• Ranking hubs and authorities using matrix functions
• Numerical methods for Gremban's expansion of signed graphs
• On different ranking methods
• Ranking by outdegree for directed graphs
• Dirichlet PageRank and trust-based ranking algorithms

Cites work

• A NEW MEASURE OF RANK CORRELATION
• Authoritative sources in a hyperlinked environment
• Google's PageRank and beyond. The science of search engine rankings
• On the strength of connectedness of a random graph
• Prediction and clustering in signed networks: a local to global perspective
• Statistical mechanics of complex networks
• The probabilistic method

Cited in

(3)

• scientific article; zbMATH DE number 4072701 (Why is no real title available?)
• Numerical methods for Gremban's expansion of signed graphs
• scientific article; zbMATH DE number 6125202 (Why is no real title available?)

This page was built for publication: On the exponential ranking and its linear counterpart

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