Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations

DOI10.1137/19M1244822zbMath1484.90131arXiv1805.08531MaRDI QIDQ5027016

No author found.

Publication date: 3 February 2022

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

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

zbMATH Keywords

averagingconsensusJacobi orthogonal polynomialsdistributedgossippolynomial iterationsmultiagentLaplacian solvers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Distributed systems (68M14) Distributed algorithms (68W15)

Uses Software

• OPQ
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariance principle for the random conductance model
• Chebyshev acceleration of iterative refinement
• Recent progress on the random conductance model
• Géza Freud, orthogonal polynomials and Christoffel functions. A case study
• Moderate growth and random walk on finite groups
• Isoperimetry and heat kernel decay on percolation clusters.
• Analysis of accelerated gossip algorithms
• Spectral asymptotics of the Laplacian on supercritical bond-percolation graphs
• Random Walk: A Modern Introduction
• A Survey on Spectra of infinite Graphs
• Orthogonal polynomials
• Random Geometric Graphs
• Geographic Gossip: Efficient Averaging for Sensor Networks
• Estimation From Relative Measurements: Electrical Analogy and Large Graphs
• Fast Distributed Average Consensus Algorithms Based on Advection-Diffusion Processes
• Efficient schemes for nearest neighbor load balancing

This page was built for publication: Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations