Laplacian spectra and synchronization processes on complex networks

Abstract

The spectrum of the Laplacian matrix of a network contains a great deal of information about the network structure and plays a fundamental role in the dynamical behavior of the network. This chapter is to explore and analyze the Laplacian eigenvalue distributions of several typical network models, to study the network dynamics towards synchronization at a mesoscale level of description, and to report the finding of a relation between the spectral information of the Laplacian matrix and the dynamics in the network synchronization process. First, an example of adding long-distance edges is given to show that the network synchronizability may not be directly inferred from statistical properties of the network. Then, the Laplacian eigenvalues of several representative complex networks are shown to possess very different properties, and yet they also share some common features meanwhile. Further, the correlation between the Laplacian spectrum and the nodedegree sequence of a network is investigated, revealing that scale-free networks have the highest correlation values, followed by random networks and then by small-world networks. To that end, a simple local prediction–correction algorithm is presented for approximating the eigenvalue λi+1 from λi, i = 1,2, ·,N, where N is the network size. Finally, it is shown that the processes of synchronization and generalized synchronization (GS) display different patterns, depending intrinsically on the topological structures of the networks. It is found that in the process of synchronization (or GS), roughly speaking, synchronization (or GS) first starts from a small part of hub nodes and then spreads to the other nodes with smaller degrees. It is also demonstrated that, for community networks, a typical synchronization process generally starts from partial synchronization through cluster synchronization to evolve to global complete synchronization.