Order-Optimal Consensus Through Randomized Path Averaging

DOI10.1109/TIT.2010.2060050MaRDI QIDQ5281267zbMATH OpenOpenAlexWikidataFDO

Authors Florence Bénézit, Alexandros G. Dimakis, Patrick Thiran, Martin Vetterli

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2010.2060050

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Communication theory (94A05)

Recommendations

• Randomized optimal consensus of multi-agent systems
• Average Consensus Over High-Order Multiagent Systems
• Convergence of random sleep algorithms for optimal consensus
• Distributed constrained stochastic optimal consensus
• Dynamic average consensus via nonlinear protocols
• Linear time average consensus and distributed optimization on fixed graphs
• Asymptotic optimality for consensus-type stochastic approximation algorithms using iterate averaging
• Average Consensus in the Presence of Delays in Directed Graph Topologies
• Approximate consensus in highly dynamic networks: the role of averaging algorithms
• Optimal strategies in the average consensus problem

Cited in

(6)

• Optimal strategies in the average consensus problem
• Linear time average consensus and distributed optimization on fixed graphs
• Consensus-based modeling using distributed feature construction with ILP
• Characterizing limits and opportunities in speeding up Markov chain mixing
• Convergence analysis of inexact randomized iterative methods
• Lower bounds for in-network computation of arbitrary functions

This page was built for publication: Order-Optimal Consensus Through Randomized Path Averaging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281267)