Standard

Network Centralities Based on Non-additive Measures. / Nikitina, Natalia; Mazalov, Vladimir.

2022. 260-271 Работа представлена на 21st International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2022, Petrozavodsk, Российская Федерация.

Результаты исследований: Материалы конференцийматериалыРецензирование

Harvard

Nikitina, N & Mazalov, V 2022, 'Network Centralities Based on Non-additive Measures', Работа представлена на 21st International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2022, Petrozavodsk, Российская Федерация, 2/07/22 - 6/07/22 стр. 260-271. https://doi.org/10.1007/978-3-031-16224-4_18

APA

Nikitina, N., & Mazalov, V. (2022). Network Centralities Based on Non-additive Measures. 260-271. Работа представлена на 21st International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2022, Petrozavodsk, Российская Федерация. https://doi.org/10.1007/978-3-031-16224-4_18

Vancouver

Nikitina N, Mazalov V. Network Centralities Based on Non-additive Measures. 2022. Работа представлена на 21st International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2022, Petrozavodsk, Российская Федерация. https://doi.org/10.1007/978-3-031-16224-4_18

Author

Nikitina, Natalia ; Mazalov, Vladimir. / Network Centralities Based on Non-additive Measures. Работа представлена на 21st International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2022, Petrozavodsk, Российская Федерация.12 стр.

BibTeX

@conference{19fefd4717c4483cb62b9be7b586aef0,
title = "Network Centralities Based on Non-additive Measures",
abstract = "Network models are widely employed in many areas of science and technology. Mathematical analysis of their properties includes various methods to characterize, rank and compare network nodes. A key concept here is centrality, a numerical value of node importance in the whole network. As the links in a network represent interactions between the nodes, non-additive measures can serve to evaluate characteristics of sets of nodes considering these interactions, and thus to define new centrality measures. In this work, we investigate variants of network centralities based on non-additive measures, calculated as the Choquet integral of a function of the distance between pairs of vertices. We illustrate the applications of the constructed centrality measures on three examples: a social network, a chemical space network and a transportation network. The proposed centrality measures can complement existing methods of node ranking in different applications and serve as a starting point for developing new algorithms.",
author = "Natalia Nikitina and Vladimir Mazalov",
year = "2022",
doi = "10.1007/978-3-031-16224-4_18",
language = "русский",
pages = "260--271",
note = "null, MOTOR 2022 ; Conference date: 02-07-2022 Through 06-07-2022",
url = "http://motor2022.krc.karelia.ru/en/section/1",

}

RIS

TY - CONF

T1 - Network Centralities Based on Non-additive Measures

AU - Nikitina, Natalia

AU - Mazalov, Vladimir

PY - 2022

Y1 - 2022

N2 - Network models are widely employed in many areas of science and technology. Mathematical analysis of their properties includes various methods to characterize, rank and compare network nodes. A key concept here is centrality, a numerical value of node importance in the whole network. As the links in a network represent interactions between the nodes, non-additive measures can serve to evaluate characteristics of sets of nodes considering these interactions, and thus to define new centrality measures. In this work, we investigate variants of network centralities based on non-additive measures, calculated as the Choquet integral of a function of the distance between pairs of vertices. We illustrate the applications of the constructed centrality measures on three examples: a social network, a chemical space network and a transportation network. The proposed centrality measures can complement existing methods of node ranking in different applications and serve as a starting point for developing new algorithms.

AB - Network models are widely employed in many areas of science and technology. Mathematical analysis of their properties includes various methods to characterize, rank and compare network nodes. A key concept here is centrality, a numerical value of node importance in the whole network. As the links in a network represent interactions between the nodes, non-additive measures can serve to evaluate characteristics of sets of nodes considering these interactions, and thus to define new centrality measures. In this work, we investigate variants of network centralities based on non-additive measures, calculated as the Choquet integral of a function of the distance between pairs of vertices. We illustrate the applications of the constructed centrality measures on three examples: a social network, a chemical space network and a transportation network. The proposed centrality measures can complement existing methods of node ranking in different applications and serve as a starting point for developing new algorithms.

U2 - 10.1007/978-3-031-16224-4_18

DO - 10.1007/978-3-031-16224-4_18

M3 - материалы

SP - 260

EP - 271

Y2 - 2 July 2022 through 6 July 2022

ER -

ID: 133392978