Synchronization in random weighted directed networks

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

Research output: Contribution to journalArticlepeer-review


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
Issue number10
StatePublished - 2008


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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture


Dive into the research topics of 'Synchronization in random weighted directed networks'. Together they form a unique fingerprint.

Cite this