Open AccessFlow approaches to community allocation in complex network systems
Author(s) -
Olexandr Polishchuk
Publication year - 2021
Publication title -
fìziko-matematične modelûvannâ ta ìnformacìjnì tehnologìï/fìzìko-matematične modelûvannâ ta ìnformacìjnì tehnologìï
Language(s) - English
Resource type - Journals
eISSN - 2617-5258
pISSN - 1816-1545
DOI - 10.15407/fmmit2021.33.122
Subject(s) - computer science , complex network , subordination (linguistics) , core (optical fiber) , flow network , complex system , flow (mathematics) , theoretical computer science , data mining , distributed computing , mathematical optimization , artificial intelligence , mathematics , telecommunications , philosophy , linguistics , geometry , world wide web
The paper investigates the problem of finding communities in complex network systems, the detec-tion of which allows a better understanding of the laws of their functioning. To solve this problem, two approaches are proposed based on the use of flows characteristics of complex network. The first of these approaches consists in calculating the parameters of influence of separate subsys-tems of the network system, distinguished by the principles of ordering or subordination, and the second, in using the concept of its flow core. Based on the proposed approaches, reliable criteria for finding communities have been formulated and efficient algorithms for their detection in com-plex network systems have been developed. It is shown that the proposed approaches make it pos-sible to single out communities in cases in which the existing numerical and visual methods turn out to be disabled.