@inproceedings{796658c6bcb5469a9c6d042808e6bd9e,
title = "On the Exponential Ranking and Its Linear Counterpart",
abstract = "This paper deals with ranking algorithms for signed graphs. We analyze the algebraic properties of the exponential ranking algorithm and suggest an alternative ranking scheme that is close to the exponential ranking in several respects, but which also enjoys the property of being linear. We discuss the properties of the introduced scheme and present both algebraic and numerical evidence that it is indeed very close to the exponential ranking.",
keywords = "Exponential ranking, Kendall{\textquoteright}s tau, Rank correlation, Ranking, Signed networks",
author = "Dmitry Gromov and Elizaveta Evmenova",
note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 10th International Conference on Complex Networks and Their Applications, COMPLEX NETWORKS 2021 ; Conference date: 30-11-2021 Through 02-12-2021",
year = "2022",
doi = "10.1007/978-3-030-93409-5\_22",
language = "English",
isbn = "9783030934088",
series = "Studies in Computational Intelligence",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "260--270",
editor = "Benito, \{Rosa Maria\} and Chantal Cherifi and Hocine Cherifi and Esteban Moro and Rocha, \{Luis M.\} and Marta Sales-Pardo",
booktitle = "Complex Networks and Their Applications X - Proceedings of the 10th International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021",
address = "Germany",
}