Torra, Vicenç and Narukawa, Yasuo (2019) On network analysis using non-additive integrals: extending the game-theoretic network centrality. Soft Computing, 23. pp. 2321-2329. ISSN 1432-7643

Preview

Download (377kB) | Preview

Abstract

There are large amounts of information that can be represented in terms of graphs. This includes social networks and internet. We can represent people and their interactions by means of graphs. Similarly, we can represent web pages (and sites) as well as links between pages by means of graphs. In order to study the properties of graphs, several indices have been defined. They include degree centrality, betweenness, and closeness. In this paper, we propose the use of Choquet and Sugeno integrals with respect to non-additive measures for network analysis. This is a natural extension of the use of game theory for network analysis. Recall that monotonic games in game theory are non-additive measures.We discuss the expected force, a centrality measure, in the light of non-additive integral network analysis. We also show that some results by Godo et al. can be used to compute network indices when the information associated with a graph is qualitative.

Item Type:	Article
Keywords:	Non-additive measures and integrals; Graphs; Aggregation; Network analysis;
Academic Unit:	Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	14064
Identification Number:	https://doi.org/10.1007/s00500-018-03710-9
Depositing User:	Vicenç Torra
Date Deposited:	24 Feb 2021 14:59
Journal or Publication Title:	Soft Computing
Publisher:	Springer
Refereed:	Yes
URI:	Publisher
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads