Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs

We propose a new method for maximizing the spread of influence, based on the identification of significant factors of the total energy of a control system. The model of a socio-economic system can be represented in the form of cognitive maps that are directed signed weighted graphs with cause-and-effect relationships and cycles. Identification and selection of target factors and effective control factors of a system is carried out as a solution to the optimal control problem. The influences are determined by the solution to optimization problem of maximizing the objective function, leading to matrix symmetrization. The gear-ratio symmetrization is based on computing the similarity extent of fan-beam structures of the influence spread of vertices v_i and v_j to all other vertices. This approach provides the real computational domain and correctness of solving the optimal control problem. In addition, it does not impose requirements for graphs to be ordering relationships, to have a matrix of special type or to fulfill stability conditions. In this paper, determination of new metrics of vertices, indicating and estimating the extent and the ability to effectively control, are likewise offered. Additionally, we provide experimental results over real cognitive models in support.

[1]  Sanming Zhou,et al.  Quotient FCMs-a decomposition theory for fuzzy cognitive maps , 2003, IEEE Trans. Fuzzy Syst..

[2]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[3]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[4]  Daniele Marinazzo,et al.  Kernel-Granger causality and the analysis of dynamical networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Bart Kosko,et al.  Fuzzy Cognitive Maps , 1986, Int. J. Man Mach. Stud..

[6]  B. Parlett The Symmetric Eigenvalue Problem , 1981 .

[7]  Michalis Vazirgiannis,et al.  Clustering and Community Detection in Directed Networks: A Survey , 2013, ArXiv.

[8]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[9]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[10]  Star X. Zhao,et al.  Exploring the directed h-degree in directed weighted networks , 2012, J. Informetrics.

[11]  Ming Liu,et al.  An influence power-based clustering approach with PageRank-like model , 2016, Appl. Soft Comput..

[12]  Alexander Tselykh,et al.  Fuzzy Graphs Clustering with Quality Relation Functionals in Cognitive Models , 2016 .

[13]  Gao Cong,et al.  Simulated Annealing Based Influence Maximization in Social Networks , 2011, AAAI.

[14]  Shengchao Qin,et al.  Maximizing influence under influence loss constraint in social networks , 2016, Expert Syst. Appl..

[15]  B. S. Garbow,et al.  Matrix Eigensystem Routines — EISPACK Guide , 1974, Lecture Notes in Computer Science.

[16]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[17]  Tom A. B. Snijders,et al.  Social Network Analysis , 2011, International Encyclopedia of Statistical Science.