通过孔多塞原理的接近中心性

IF 2.9 2区 社会学 Q1 ANTHROPOLOGY Social Networks Pub Date : 2023-07-01 DOI:10.1016/j.socnet.2023.01.005
Oskar Skibski
{"title":"通过孔多塞原理的接近中心性","authors":"Oskar Skibski","doi":"10.1016/j.socnet.2023.01.005","DOIUrl":null,"url":null,"abstract":"<div><p>We provide a characterization of closeness centrality in the class of distance-based centralities. To this end, we introduce a natural property, called <em>majority comparison</em>, 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.</p></div>","PeriodicalId":48353,"journal":{"name":"Social Networks","volume":"74 ","pages":"Pages 13-18"},"PeriodicalIF":2.9000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Closeness centrality via the Condorcet principle\",\"authors\":\"Oskar Skibski\",\"doi\":\"10.1016/j.socnet.2023.01.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We provide a characterization of closeness centrality in the class of distance-based centralities. To this end, we introduce a natural property, called <em>majority comparison</em>, 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.</p></div>\",\"PeriodicalId\":48353,\"journal\":{\"name\":\"Social Networks\",\"volume\":\"74 \",\"pages\":\"Pages 13-18\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2023-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Social Networks\",\"FirstCategoryId\":\"90\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0378873323000059\",\"RegionNum\":2,\"RegionCategory\":\"社会学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ANTHROPOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Social Networks","FirstCategoryId":"90","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378873323000059","RegionNum":2,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ANTHROPOLOGY","Score":null,"Total":0}
引用次数: 3

摘要

我们在一类基于距离的中心性中提供了接近中心性的特征。为此,我们引入了一种称为多数比较的自然性质,即在两个相邻节点中,离更多节点更近的节点更为中心。我们证明了任何满足这一性质的基于距离的中心性在每个图中都给出了与贴近度中心性相同的排序。该公理的灵感来自于将图解释为一种选举,其中节点既是选民又是候选人,他们的偏好由与其他节点的距离决定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Closeness centrality via the Condorcet principle

We 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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Social Networks
Social Networks Multiple-
CiteScore
5.90
自引率
12.90%
发文量
118
期刊介绍: Social Networks is an interdisciplinary and international quarterly. It provides a common forum for representatives of anthropology, sociology, history, social psychology, political science, human geography, biology, economics, communications science and other disciplines who share an interest in the study of the empirical structure of social relations and associations that may be expressed in network form. It publishes both theoretical and substantive papers. Critical reviews of major theoretical or methodological approaches using the notion of networks in the analysis of social behaviour are also included, as are reviews of recent books dealing with social networks and social structure.
期刊最新文献
Why distinctiveness centrality is distinctive Editorial Board How many friends do youth nominate? A meta-analysis of gender, age, and geographic differences in average outdegree centrality A stopping rule for randomly sampling bipartite networks with fixed degree sequences Multilevel integrated healthcare: The evaluation of Project ECHO® networks to integrate children’s healthcare in Australia
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1