skip to main content

Title: Synchronizability of random rectangular graphs

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.
Authors:
;  [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)
Publication Date:
OSTI Identifier:
22482312
Resource Type:
Journal Article
Resource Relation:
Journal Name: Chaos (Woodbury, N. Y.); Journal Volume: 25; Journal Issue: 8; Other Information: (c) 2015 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; CHAOS THEORY; DIAGRAMS; GEOMETRY; GRAPH THEORY; LAPLACIAN; MATRICES; RANDOMNESS; SYNCHRONIZATION