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.

Original languageEnglish
Title of host publicationComplex Networks and Their Applications X
Subtitle of host publicationProceedings of the 10th International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021
EditorsRosa Maria Benito, Chantal Cherifi, Hocine Cherifi, Esteban Moro, Luis M. Rocha, Marta Sales-Pardo
PublisherSpringer Nature
Pages260-270
Number of pages11
Volume1
ISBN (Print)9783030934088
DOIs
StatePublished - 2022
Event10th International Conference on Complex Networks and Their Applications, COMPLEX NETWORKS 2021 - Madrid, Spain
Duration: 30 Nov 20212 Dec 2021

Publication series

NameStudies in Computational Intelligence
Volume1015
ISSN (Print)1860-949X
ISSN (Electronic)1860-9503

Conference

Conference10th International Conference on Complex Networks and Their Applications, COMPLEX NETWORKS 2021
Country/TerritorySpain
CityMadrid
Period30/11/212/12/21

    Research areas

  • Exponential ranking, Kendall’s tau, Rank correlation, Ranking, Signed networks

    Scopus subject areas

  • Artificial Intelligence

ID: 91850645