Order-Optimal Consensus Through Randomized Path Averaging

DOI10.1109/TIT.2010.2060050zbMath1366.94010OpenAlexW2127850304WikidataQ59341407 ScholiaQ59341407MaRDI QIDQ5281267

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

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)

Related Items (5)

Consensus-based modeling using distributed feature construction with ILP ⋮ Linear Time Average Consensus and Distributed Optimization on Fixed Graphs ⋮ Lower bounds for in-network computation of arbitrary functions ⋮ Characterizing limits and opportunities in speeding up Markov chain mixing ⋮ Convergence Analysis of Inexact Randomized Iterative Methods

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