.png){kind=icon}
.png){kind=icon}
Return
Synchronization in Random Weighted Directed Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2008.925357.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
Journal
IF:
5.2
Papers:
9.7K
Citations:
2.2W