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 - 2008

Fingerprint

Synchronization
Switches

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Synchronization in random weighted directed networks. / Porfiri, Maurizio; Stilwell, Daniel J.; Bollt, Erik M.

In: IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 55, No. 10, 2008, p. 3170-3177.

Research output: Contribution to journalArticle

Porfiri, Maurizio ; Stilwell, Daniel J. ; Bollt, Erik M. / Synchronization in random weighted directed networks. In: IEEE Transactions on Circuits and Systems I: Regular Papers. 2008 ; Vol. 55, No. 10. pp. 3170-3177.
@article{0719e861db5846a595e26e755b3769c5,
title = "Synchronization in random weighted directed networks",
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.",
keywords = "Ad hoc networking, Directed graphs, Fast switching, Random graphs, Synchronization, Weighted graphs",
author = "Maurizio Porfiri and Stilwell, {Daniel J.} and Bollt, {Erik M.}",
year = "2008",
doi = "10.1109/TCSI.2008.925357",
language = "English (US)",
volume = "55",
pages = "3170--3177",
journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",
issn = "1057-7122",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Synchronization in random weighted directed networks

AU - Porfiri, Maurizio

AU - Stilwell, Daniel J.

AU - Bollt, Erik M.

PY - 2008

Y1 - 2008

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

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

KW - Ad hoc networking

KW - Directed graphs

KW - Fast switching

KW - Random graphs

KW - Synchronization

KW - Weighted graphs

UR - http://www.scopus.com/inward/record.url?scp=57149130690&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57149130690&partnerID=8YFLogxK

U2 - 10.1109/TCSI.2008.925357

DO - 10.1109/TCSI.2008.925357

M3 - Article

VL - 55

SP - 3170

EP - 3177

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1057-7122

IS - 10

ER -