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 synchronization as long as the expected value of the network is connected, and that the switching rate is sufficiently fast.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the 2007 American Control Conference, ACC |
Pages | 2387-2392 |
Number of pages | 6 |
DOIs | |
State | Published - 2007 |
Event | 2007 American Control Conference, ACC - New York, NY, United States Duration: Jul 9 2007 → Jul 13 2007 |
Publication series
Name | Proceedings of the American Control Conference |
---|---|
ISSN (Print) | 0743-1619 |
Other
Other | 2007 American Control Conference, ACC |
---|---|
Country | United States |
City | New York, NY |
Period | 7/9/07 → 7/13/07 |
Keywords
- Ad hoc networking
- Directed graphs
- Fast switching
- Random graphs
- Synchronization
- Weighted graphs
ASJC Scopus subject areas
- Electrical and Electronic Engineering