Artykuł w czasopiśmie
Brak miniatury
Licencja

ClosedAccessDostęp zamknięty
 

Closeness centrality via the Condorcet principle

cris.lastimport.scopus2024-02-12T19:43:18Z
dc.abstract.enWe provide a characterization of closeness centrality in the class of distance-based centralities. To this end, we introduce a natural property, called majority comparison, that states that out of two adjacent nodes the one closer to more nodes is more central. We prove that any distance-based centrality that satisfies this property gives the same ranking in every graph as closeness centrality. The axiom is inspired by the interpretation of the graph as an election in which nodes are both voters and candidates and their preferences are determined by the distances to the other nodes.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorSkibski, Oskar
dc.date.accessioned2024-01-24T19:26:02Z
dc.date.available2024-01-24T19:26:02Z
dc.date.issued2023
dc.description.financePublikacja bezkosztowa
dc.description.volume74
dc.identifier.doi10.1016/J.SOCNET.2023.01.005
dc.identifier.issn0378-8733
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/103157
dc.identifier.weblinkhttps://api.elsevier.com/content/article/PII:S0378873323000059?httpAccept=text/xml
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofSocial Networks
dc.relation.pages13-18
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enCentrality measures
dc.subject.enCloseness centrality
dc.subject.enAxioms
dc.subject.enCondorcet principle
dc.subject.enDistance
dc.titleCloseness centrality via the Condorcet principle
dc.typeJournalArticle
dspace.entity.typePublication