中心性测度的凸组合

IF 1.3 4区社会学 Q3 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS

Journal of Mathematical Sociology Pub Date : 2020-07-27 DOI:10.1080/0022250X.2020.1765776

Ying Ying Keng, K. Kwa, Chris McClain

{"title":"中心性测度的凸组合","authors":"Ying Ying Keng, K. Kwa, Chris McClain","doi":"10.1080/0022250X.2020.1765776","DOIUrl":null,"url":null,"abstract":"ABSTRACT Despite a plethora of centrality measures were proposed, there is no consensus on what centrality is exactly due to the shortcomings each measure has. In this manuscript, we propose to combine centrality measures pertinent to a network by forming their convex combinations. We found that some combinations, induced by regular points, split the nodes into the largest number of classes by their rankings. Moreover, regular points are found with probability and their induced rankings are insensitive to small variation. By contrast, combinations induced by critical points are scarce, but their presence enables the variation in node rankings. We also discuss how optimum combinations could be chosen, while proving various properties of the convex combinations of centrality measures.","PeriodicalId":50139,"journal":{"name":"Journal of Mathematical Sociology","volume":"45 1","pages":"195 - 222"},"PeriodicalIF":1.3000,"publicationDate":"2020-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0022250X.2020.1765776","citationCount":"7","resultStr":"{\"title\":\"Convex combinations of centrality measures\",\"authors\":\"Ying Ying Keng, K. Kwa, Chris McClain\",\"doi\":\"10.1080/0022250X.2020.1765776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Despite a plethora of centrality measures were proposed, there is no consensus on what centrality is exactly due to the shortcomings each measure has. In this manuscript, we propose to combine centrality measures pertinent to a network by forming their convex combinations. We found that some combinations, induced by regular points, split the nodes into the largest number of classes by their rankings. Moreover, regular points are found with probability and their induced rankings are insensitive to small variation. By contrast, combinations induced by critical points are scarce, but their presence enables the variation in node rankings. We also discuss how optimum combinations could be chosen, while proving various properties of the convex combinations of centrality measures.\",\"PeriodicalId\":50139,\"journal\":{\"name\":\"Journal of Mathematical Sociology\",\"volume\":\"45 1\",\"pages\":\"195 - 222\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2020-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/0022250X.2020.1765776\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Mathematical Sociology\",\"FirstCategoryId\":\"90\",\"ListUrlMain\":\"https://doi.org/10.1080/0022250X.2020.1765776\",\"RegionNum\":4,\"RegionCategory\":\"社会学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematical Sociology","FirstCategoryId":"90","ListUrlMain":"https://doi.org/10.1080/0022250X.2020.1765776","RegionNum":4,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 7

摘要

摘要尽管提出了过多的中心性度量，但由于每种度量的缺点，人们对中心性究竟是什么还没有达成共识。在这篇手稿中，我们提出通过形成它们的凸组合来组合与网络相关的中心性度量。我们发现，一些由规则点诱导的组合会根据节点的排名将其划分为最多的类。此外，规则点是有概率的，它们的诱导排名对小的变化不敏感。相比之下，由临界点诱导的组合很少，但它们的存在使得节点排名发生变化。我们还讨论了如何选择最佳组合，同时证明了中心测度的凸组合的各种性质。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Convex combinations of centrality measures

ABSTRACT Despite a plethora of centrality measures were proposed, there is no consensus on what centrality is exactly due to the shortcomings each measure has. In this manuscript, we propose to combine centrality measures pertinent to a network by forming their convex combinations. We found that some combinations, induced by regular points, split the nodes into the largest number of classes by their rankings. Moreover, regular points are found with probability and their induced rankings are insensitive to small variation. By contrast, combinations induced by critical points are scarce, but their presence enables the variation in node rankings. We also discuss how optimum combinations could be chosen, while proving various properties of the convex combinations of centrality measures.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Mathematical Sociology 数学-数学跨学科应用

CiteScore

2.90

自引率

10.00%

发文量

审稿时长

>12 weeks

期刊介绍： The goal of the Journal of Mathematical Sociology is to publish models and mathematical techniques that would likely be useful to professional sociologists. The Journal also welcomes papers of mutual interest to social scientists and other social and behavioral scientists, as well as papers by non-social scientists that may encourage fruitful connections between sociology and other disciplines. Reviews of new or developing areas of mathematics and mathematical modeling that may have significant applications in sociology will also be considered. The Journal of Mathematical Sociology is published in association with the International Network for Social Network Analysis, the Japanese Association for Mathematical Sociology, the Mathematical Sociology Section of the American Sociological Association, and the Methodology Section of the American Sociological Association.