The paper investigates the problem of finding communities in complex network systems, the detection 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 subsystems 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 complex network systems have been developed. It is shown that the proposed approaches make it possible to single out communities in cases in which the existing numerical and visual methods turn out to be disabled.

中文翻译：

---

复杂网络系统中社区检测的流程方法

本文调查了在复杂的网络系统中寻找社区的问题，对其进行检测可以更好地了解其运行规律。为了解决这个问题，基于复杂网络的流量特性，提出了两种方法。这些方法中的第一种方法是计算网络系统的各个子系统的影响参数（通过顺序或从属原则来区分），第二种方法是使用流核心的概念。基于提出的方法，已经制定了寻找社区的可靠标准，并开发了用于在复杂网络系统中进行检测的有效算法。