Finite-time projective synchronization between two different complex networks

The paper investigates the problem of finite-time projective synchronization between two different complex networks, where two complex networks may be different in the node dynamics, or in the topological structures. By using a finite-time stability theorem and inequality techniques, a sufficient criterion is derived based on Lyapunov stability theory, in the form of linear matrix inequalities (LMIs). The LMIs are readily solved by the LMI toolbox in Matlab. At last, a numerical example is given to illustrate the feasibility and effectiveness of the proposed method. It is worth noting that the coupling configuration matrix is not necessarily symmetric or irreducible; and the inner coupling matrix does not need to be symmetric.