Notes on linear gossip algorithms: potentials and challenges

DOI10.1007/S11424-025-4534-4MaRDI QIDQ6950663zbMATH OpenFDO

Authors Balázs Gerencsér, László Gerencsér

Publication date 30 July 2025

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

zbMATH Keywords

consensusLyapunov exponentsspectral gapgossip algorithms

Mathematics Subject Classification ID

Networked control (93B70) Consensus (93D50)

Cites work

• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 6968012 (Why is no real title available?)
• scientific article; zbMATH DE number 3375319 (Why is no real title available?)
• A Necessary and Sufficient Condition for Consensus Over Random Networks
• A proof of Oseledec's multiplicative ergodic theorem
• A survey of computational complexity results in systems and control
• Almost sure exponential convergence to consensus of random gossip algorithms
• Analysis of Sum-Weight-Like Algorithms for Averaging in Wireless Sensor Networks
• Average consensus on general strongly connected digraphs
• Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies
• Consensus Over Ergodic Stationary Graph Processes
• Continuous-time average-preserving opinion dynamics with opinion-dependent communications
• Convergence of sequential and asynchronous nonlinear paracontractions
• Non-negative matrices and Markov chains.
• Products of Random Matrices
• Push-Sum With Transmission Failures
• The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
• The strong consistency of maximum likelihood estimators for ARMA processes
• Tight Bounds on the Convergence Rate of Generalized Ratio Consensus Algorithms

This page was built for publication: Notes on linear gossip algorithms: potentials and challenges

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