Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
On consensus over stochastically switching directed topologies
ACC'09 Proceedings of the 2009 conference on American Control Conference
Reaching consensus in wireless networks with probabilistic broadcast
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Asymptotic analysis of quadratic error of consensus in large-scale random directed networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Convergence of consensus models with stochastic disturbances
IEEE Transactions on Information Theory
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
IEEE Transactions on Signal Processing
Order-optimal consensus through randomized path averaging
IEEE Transactions on Information Theory
Interaction-driven opinion dynamics in online social networks
Proceedings of the First Workshop on Social Media Analytics
Distributed consensus for multi-agent systems with delays and noises in transmission channels
Automatica (Journal of IFAC)
Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Brief paper: A majorization inequality and its application to distributed Kalman filtering
Automatica (Journal of IFAC)
SIAM Journal on Control and Optimization
Average TimeSynch: A consensus-based protocol for clock synchronization in wireless sensor networks
Automatica (Journal of IFAC)
An Eulerian Approach to the Analysis of Krause's Consensus Models
SIAM Journal on Control and Optimization
On backward product of stochastic matrices
Automatica (Journal of IFAC)
Distributed parametric and nonparametric regression with on-line performance bounds computation
Automatica (Journal of IFAC)
Randomized optimal consensus of multi-agent systems
Automatica (Journal of IFAC)
Opinion Fluctuations and Disagreement in Social Networks
Mathematics of Operations Research
Think globally, act locally: on the reshaping of information landscapes
Proceedings of the 12th international conference on Information processing in sensor networks
On the mean square error of randomized averaging algorithms
Automatica (Journal of IFAC)
| Hi-index | 0.21 |
Various randomized consensus algorithms have been proposed in the literature. In some case randomness is due to the choice of a randomized network communication protocol. In other cases, randomness is simply caused by the potential unpredictability of the environment in which the distributed consensus algorithm is implemented. Conditions ensuring the convergence of these algorithms have already been proposed in the literature. As far as the rate of convergence of such algorithms, two approaches can be proposed. One is based on a mean square analysis, while a second is based on the concept of Lyapunov exponent. In this paper, by some concentration results, we prove that the mean square convergence analysis is the right approach when the number of agents is large. Differently from the existing literature, in this paper we do not stick to average preserving algorithms. Instead, we allow to reach consensus at a point which may differ from the average of the initial states. The advantage of such algorithms is that they do not require bidirectional communication among agents and thus they apply to more general contexts. Moreover, in many important contexts it is possible to prove that the displacement from the initial average tends to zero, when the number of agents goes to infinity.