Synchronizability of random rectangular graphs

Journal Article · Sat Aug 15 00:00:00 EDT 2015 · Chaos (Woodbury, N. Y.)

DOI:https://doi.org/10.1063/1.4928333· OSTI ID:22482312

Estrada, Ernesto; Chen, Guanrong ^[1]

---

1. Department of Mathematics & Statistics, University of Strathclyde, 26 Richmond Street, Glasgow G1 1XQ, United Kingdom and Department of Electronic Engineering, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon (Hong Kong)

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.

• OSTI ID: 22482312
• Journal Information: Chaos (Woodbury, N. Y.), Vol. 25, Issue 8; Other Information: (c) 2015 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA); ISSN 1054-1500
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
CHAOS THEORY
DIAGRAMS
GEOMETRY
GRAPH THEORY
LAPLACIAN
MATRICES
RANDOMNESS
SYNCHRONIZATION