K-method of calculating the mutual influence of nodes in a directed weight complex networks
Andrei Snarskii, Dmyto Lande, Dmyto Manko
(Submitted on 16 Jul 2018)
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.