Synchronizability of random rectangular graphs.

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… (More)
DOI: 10.1063/1.4928333

Topics

3 Figures and Tables

Slides referencing similar topics