Synchronizability of random rectangular graphs

Ernesto Estrada, Guanrong Chen

Research output: Contribution to journalArticle

8 Citations (Scopus)

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.
LanguageEnglish
Article number083107
Number of pages7
JournalChaos: An Interdisciplinary Journal of Nonlinear Science
Volume25
Issue number8
DOIs
Publication statusPublished - 1 Aug 2015

Fingerprint

Chaotic systems
Synchronization
Graph in graph theory
Processing
Random Geometric Graph
Laplacian Matrix
Lorenz System
Graph Model
Vertex of a graph
Hypercube
Chaotic System
Upper and Lower Bounds
synchronism
matrices

Keywords

  • cluster analysis
  • synchronization
  • network topology
  • networks
  • graph theory

Cite this

@article{75b41ff6daaa474ca7a692b81e205b97,
title = "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 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.",
keywords = "cluster analysis, synchronization, network topology, networks, graph theory",
author = "Ernesto Estrada and Guanrong Chen",
year = "2015",
month = "8",
day = "1",
doi = "10.1063/1.4928333",
language = "English",
volume = "25",
journal = "Chaos",
issn = "1054-1500",
number = "8",

}

Synchronizability of random rectangular graphs. / Estrada, Ernesto; Chen, Guanrong.

In: Chaos: An Interdisciplinary Journal of Nonlinear Science, Vol. 25, No. 8, 083107, 01.08.2015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Synchronizability of random rectangular graphs

AU - Estrada, Ernesto

AU - Chen, Guanrong

PY - 2015/8/1

Y1 - 2015/8/1

N2 - 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.

AB - 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.

KW - cluster analysis

KW - synchronization

KW - network topology

KW - networks

KW - graph theory

UR - http://scitation.aip.org/content/aip/journal/chaos/25/8/10.1063/1.4928333

U2 - 10.1063/1.4928333

DO - 10.1063/1.4928333

M3 - Article

VL - 25

JO - Chaos

T2 - Chaos

JF - Chaos

SN - 1054-1500

IS - 8

M1 - 083107

ER -