Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory
Hui Liu, Ming Cao, Chai Wah Wu
Abstract
Hui Liu, Ming Cao, Chai Wah Wu
Abstract
Using spectral graph theory and especially its graph comparison techniques, we propose new methodologies to allocate coupling strengths to guarantee global complete synchronization in complex networks. The key step is that all the eigenvalues of the Laplacian matrix associated with a given network can be estimated by utilizing flexibly topological features of the network. The proposed methodologies enable the construction of different coupling-strength combinations in response to different knowledge about subnetworks. Adaptive allocation strategies can be carried out as well using only local network topological information. Besides formal analysis, we use simulation examples to demonstrate how to apply the methodologies to typical complex networks.
OpenAlex reports 44 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Using spectral graph theory and especially its graph comparison techniques, we propose new methodologies to allocate coupling strengths to guarantee global complete synchronization in complex networks. The key step is that all the eigenvalues of the Laplacian matrix associated with a given network can be estimated by utilizing flexibly topological features of the network. The proposed methodologies enable the construction of different coupling-strength combinations in response to different knowledge about subnetworks. Adaptive allocation strategies can be carried out as well using only local network topological information. Besides formal analysis, we use simulation examples to demonstrate how to apply the methodologies to typical complex networks.
Key concepts: Spectral graph theory, Laplacian matrix, Graph theory, Eigenvalues and eigenvectors, Synchronization (alternating current), Computer science, Topology (electrical circuits), Complex network