Synchronizability of random rectangular graphs

Estrada, Ernesto and Chen, Guanrong (2015) Synchronizability of random rectangular graphs. Chaos: An Interdisciplinary Journal of Nonlinear Science, 25 (8). 083107. ISSN 1054-1500 (

[thumbnail of Estrada-Chen-Chaos-2015-Synchronizability-of-random-rectangular]
Text. Filename: Estrada_Chen_Chaos_2015_Synchronizability_of_random_rectangular.pdf
Final Published Version

Download (862kB)| Preview


Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.


Estrada, Ernesto ORCID logoORCID: and Chen, Guanrong;