Abstract
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.
| Original language | English |
|---|---|
| Journal | Chaos |
| Volume | 25 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 2015 |
Publisher's Copyright Statement
- COPYRIGHT TERMS OF DEPOSITED FINAL PUBLISHED VERSION FILE: This article may be downloaded for personal use only. Any other use requires prior permission of the author and AIP Publishing. This article appeared in Ernesto Estrada and Guanrong Chen , "Synchronizability of random rectangular graphs", Chaos 25, 083107 (2015) and may be found at https://doi.org/10.1063/1.4928333.
Fingerprint
Dive into the research topics of 'Synchronizability of random rectangular graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver