Optimization and Analysis of Distributed Averaging With Short Node Memory

DOI10.1109/TSP.2010.2043127zbMath1392.94371arXiv0903.3537MaRDI QIDQ4570271

Mark J. Coates, Michael G. Rabbat, Boris N. Oreshkin

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.3537

Mathematics Subject Classification ID

Decision theory (91B06) Deterministic network models in operations research (90B10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Social choice (91B14)

Related Items (12)

Fast consensus algorithm of multi-agent systems with double gains regulation ⋮ Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions ⋮ Fast distributed algebraic connectivity estimation in large scale networks ⋮ Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms ⋮ Accelerated consensus to accurate average in multi-agent networks via state prediction ⋮ Fast convergent average consensus of multiagent systems based on community detection algorithm ⋮ Distributed adaptive control of linear multi-agent systems with event-triggered communications ⋮ A new class of consensus protocols for agent networks with discrete time dynamics ⋮ Characterizing limits and opportunities in speeding up Markov chain mixing ⋮ An accelerated distributed gradient method with local memory ⋮ A dual approach for optimal algorithms in distributed optimization over networks ⋮ Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds

This page was built for publication: Optimization and Analysis of Distributed Averaging With Short Node Memory