标题： 计算有向加权复杂网络中节点相互影响的K方法 显示英文标题

标题： K-method of calculating the mutual influence of nodes in a directed weight complex networks

摘要： 在有向加权复杂网络中的成对节点的一个新特性被考虑。 一种用于复杂网络特性计算的方法（称为K方法）被提出。 该方法基于将初始网络进行转换，并随后应用基尔霍夫规则。 提出了该方法在稀疏复杂网络中的适用范围。 这些复杂网络的节点是现实世界的概念，连接具有所谓的“认知图”的因果关系。 提出了两个具有语义解释的概念节点的新特性，即“压力”和“影响”，考虑到所有节点之间的相互影响。 显示英文摘要

摘要： A new characteristic of paired nodes in a directed weight complex network is considered. A method (named as K-method) of the characteristics calculation for complex networks is proposed. The method is based on transforming the initial network with the subsequent application of the Kirchhoff rules. The scope of the method for sparse complex networks is proposed. The nodes of these complex networks are concepts of the real world, and the connections have a cause-effect character of the so-called "cognitive maps". Two new characteristics of concept nodes having a semantic interpretation are proposed, namely "pressure" and "influence" taking into account the influence of all nodes on each other.