Computer Science – Multiagent Systems
Scientific paper
2009-10-20
Computer Science
Multiagent Systems
6 pages, 3 figures, submitted to American Control Conference 2010
Scientific paper
In this paper, we study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed Erdos-Renyi random graphs, where each agent can communicate with any other agent with some exogenously specified probability $p$. While it is well-known that consensus algorithms over Erdos-Renyi random networks result in an asymptotic agreement over the network, an analytical characterization of the distribution of the asymptotic consensus value is still an open question. In this paper, we provide closed-form expressions for the mean and variance of the asymptotic random consensus value, in terms of the size of the network and the probability of communication $p$. We also provide numerical simulations that illustrate our results.
Jadbabaie Ali
Preciado Victor M.
Tahbaz-Salehi Alireza
No associations
LandOfFree
Variance Analysis of Randomized Consensus in Switching Directed Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Variance Analysis of Randomized Consensus in Switching Directed Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variance Analysis of Randomized Consensus in Switching Directed Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-144805