Analysis of accelerated gossip algorithms

DOI10.1016/J.AUTOMATICA.2013.01.001MaRDI QIDQ2445150zbMATH OpenOpenAlexFDO

Authors Ji Liu, Brian D. O. Anderson, Ming Cao, A. Stephen Morse

Publication date 14 April 2014

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/2691129/2009ProcCDCLiu.pdf

zbMATH Keywords

convergence ratecooperative controldistributed averaging

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Decentralized systems (93A14)

Recommendations

• Convergence of periodic gossiping algorithms
• Accelerated gossip in networks of given dimension using Jacobi polynomial iterations
• Gossip consensus algorithms via quantized communication
• Convergence rate on periodic gossiping
• Nonlinear gossip algorithms for wireless sensor networks

Cited in

(15)

• Request-based gossiping without deadlocks
• Characterizing limits and opportunities in speeding up Markov chain mixing
• Gossip over holonomic graphs
• Convergence rate on periodic gossiping
• Nonlinear gossip algorithms for wireless sensor networks
• An enhanced Gossip algorithm based on superposition coding
• Linear time average consensus and distributed optimization on fixed graphs
• Convergence of periodic gossiping algorithms
• Accelerated gossip in networks of given dimension using Jacobi polynomial iterations
• Geographic gossip on geometric random graphs via affine combinations
• Analyzing network coding gossip made easy
• A dual approach for optimal algorithms in distributed optimization over networks
• Acceleration of gossip algorithms through the Euler–Poisson–Darboux Equation
• FJ-MM: Friedkin-Johnsen opinion dynamics model with memory and higher-order neighbors
• Average consensus on general strongly connected digraphs

This page was built for publication: Analysis of accelerated gossip algorithms

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