Synchronization in random weighted directed networks

Maurizio Porfiri, Daniel J. Stilwell, Erik M. Bollt

Research output: Contribution to journalArticle

Abstract

We assess synchronization of oscillators that are coupled via a time-varying stochastic network, modeled as a weighted directed random graph that switches at a given rate between a set of possible graphs. The existence of any graph edge is probabilistic and independent from the existence of any other edge. We further allow each edge to be weighted differently. Even if the network is always instantaneously not connected, we show that sufficient information is propagated through the network to allow almost sure local synchronization as long as the expected value of the network is connected, and that the switching rate is sufficiently fast.

Original languageEnglish (US)
Pages (from-to)3170-3177
Number of pages8
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Volume55
Issue number10
DOIs
StatePublished - Dec 10 2008

    Fingerprint

Keywords

  • Ad hoc networking
  • Directed graphs
  • Fast switching
  • Random graphs
  • Synchronization
  • Weighted graphs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this