Computational Complexity of SRIC and LRIC Indices

Shvydun, S.

Computational Complexity of SRIC and LRIC Indices

Conference paper (2020)

Authors

S. Shvydun National Research University Higher School of Economics, V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences

Affiliation

External organisation

Computational complexity Influence in networks Group influence Long-range interaction centrality Short-range interaction centrality Simple paths

To reference this document use:

http://resolver.tudelft.nl/uuid:c41a22b3-411d-4c34-a831-b9779b713f9a

More Info

expand_more

Published Date

2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

Over the past years, there is a deep interest in the analysis of different communities and complex networks. Identification of the most important elements in such networks is one of the main areas of research. However, the heterogeneity of real networks makes the problem both important and problematic. The application of SRIC and LRIC indices can be used to solve the problem since they take into account the individual properties of nodes, the possibility of their group influence, and topological structure of the whole network. However, the computational complexity of such indices needs further consideration. Our main focus is on the performance of SRIC and LRIC indices. We propose several modes on how to decrease the computational complexity of these indices. The runtime comparison of the sequential and parallel computation of the proposed models is also given.