Work

Consensus over random networks

Year: 2006
Type: conference-paper
Abstract: — We consider the decentralized consensus problem over random information networks. In such networks, the underlying graph of the network at a given time instance is random but independent of all other times. For such a framework, we present a simple necessary and sufficient criteria for asymptotic consensus using simple ergodicity and probabilistic arguments. Finally, we investigate a special case for which the decentralized consensus algorithm converges to the average of the initial values. I.
Language: English
Open Access status: green
OpenAlex ID: W2781725465
FWCI: 10.34
Cites: 22
Cited by: 82
Related to: 10