Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any connected, directed or undirected graph. Unlike most previous gossip algorithms, Weighted Gossip admits stochastic update matrices which need not be doubly stochastic. Double-stochasticity being very restrictive in a distributed setting, this novel degree of freedom is essential and it opens the perspective of designing a large number of new gossip-based algorithms. To give an example, we present one of these algorithms, which we call One-Way Averaging. It is based on random geographic routing, just like Path Averaging, except that routes are one way instead of round trip. Hence in this example, getting rid of double stochasticity allows us to add robustness to Path Averaging.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As previously remarked, our protocol is a perturbation of the so-called 'push-sum' protocol for averaging studied in [1], [4], [10].”
From Distributed Optimization Over Time-Varying Directed Graphs (2015) · cites this paper as [1]
Citations
Cites
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
PROBABILITY: THEORY AND EXAMPLES
Rogers, L. C. G. (1992) · Bulletin of the London Mathematical Society · doi:10.1112/blms/24.2.205 · Cited by 1,435
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Odentrantz, J. (2000) · Technometrics · doi:10.1080/00401706.2000.10485734 · Cited by 973
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Brémaud, P. (1999) · Texts in Applied Mathematics · doi:10.1007/978-1-4757-3124-8 · Cited by 781
Gossip algorithms: design, analysis and applications
Boyd, S., Ghosh, A., Prabbakar, B., & Shah, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498447 · Cited by 558
On Distributed Averaging Algorithms and Quantization Effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031203 · Cited by 557
Self-citationProblems in Decentralized Decision making and Computation.
Tsitsiklis, J. N. (1984) · Defense Technical Information Center (DTIC) · Cited by 288
Self-citationConsensus Over Ergodic Stationary Graph Processes
Tahbaz-Salehi, A., & Jadbabaie, A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2034054 · Cited by 233
Cited by
Items 201–261 of 261
Distributed belief averaging using sequential observations
Liu, Y., Liu, J., Başar, T., & Liu, M. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963031 · Cited by 2
Sherson, T., Heusdens, R. R., & Kleijn, W. B. (2016) · European Signal Processing Conference (EUSIPCO) · doi:10.1109/eusipco.2016.7760415 · Cited by 2
CWEmd: A Lightweight Similarity Measurement for Resource-Constrained Vehicular Networks
Qiao, C., Brown, K. N., Zhang, Y., & Tian, Z. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3282968 · Cited by 2
Dynamics-based algorithm-level privacy preservation for push-sum average consensus
Cheng, H., Xie, M., Yang, X., Lü, Q., & Li, H. (2026) · Knowledge-Based Systems · doi:10.1016/j.knosys.2026.115812 · Cited by 2
Decentralized Online Optimization with Global Objectives and Local CommunicationPreprint
Lee, S., Nedić, A., & Raginsky, M. (2015) · arXiv (Cornell University) · Cited by 2
Asynchronous subgradient push: fast, robust, and scalable multi-agent optimization
Assran, M. (2018) · doi:10.82308/55133 · Cited by 2
Low-Complexity Message-Passing Algorithms for Distributed Computation
Noorshams, N. (2013) · eScholarship (California Digital Library) · Cited by 2
Distributed Speech Enhancement in Wireless Acoustic Sensor Networks
Zeng, Y. (2015) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:9b1c231f-a4bd-4f5e-b49a-88bd465faf82 · Cited by 2
Revisiting request-based gossiping: The effects of queue updates on convergence time
Liu, J., & Morse, A. S. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426846 · Cited by 1
Asynchronous decentralized convex optimization through short-term gradient averaging
Fellus, J., Picard, D., & Gosselin, P.-H. (2015) · HAL · Cited by 1
Average-Consensus in a Deterministic Framework— Part II: Central Connectivity
Topley, K., & Krishnamurthy, V. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2215604 · Cited by 1
Agreement for networked multi-agent systems with noisy communications
Li, D., & Xiao-fan, W. (2012) · Chinese Control Conference (CCC) · Cited by 1
Low-complexity message-passing algorithms for distributed computation
Wainwright, M. J., & Noorshams, N. (2013) · Cited by 1
Geographic Greedy Triplewise Gossip Algorithm for Wireless Sensor Networks
Raheem, M. I. (2016) · Jordanian Journal of Computers and Information Technology · doi:10.5455/jjcit.71-1453111389 · Cited by 1
A fast algorithm for distributed optimization over directed networks
Zeng, J., & He, T. (2016) · IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems · doi:10.1109/cyber.2016.7574793 · Cited by 1
Wang, D., Yin, J., & Wang, W. (2018) · International Conference on Information Science and Technology · doi:10.1109/icist.2018.8426143 · Cited by 1
Local Model Privacy-Preserving Study for Federated Learning
Pan, K., He, D., & Xu, C. (2021) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-90019-9_15 · Cited by 1
Manitara, N. E., Hadjicostis, C. N., & Charalambous, T. (2022) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton49937.2022.9929394 · Cited by 1
Stochastic Activation based Broadcast Push-Sum for Distributed Estimation
Bi, Y., Ciblat, P., Wu, Y., & Hua, C. (2025) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp64130.2025.11073203 · Cited by 1
Distributed Average Consensus in Digraphs
Hadjicostis, C. N., & Domínguez-García, A. D. (2014) · Lecture notes in control and information sciences · doi:10.1007/978-3-319-10407-2_43 · Cited by 1
Fellus, J., Picard, D., & Gosselin, P.-H. (2015) · Traitement du signal · doi:10.3166/ts.32.36-64 · Cited by 1
Network Topology and Protocol Design for Efficient Consensus in Sensor Networks
Marco, C. A. (2017) · BIBSYS Brage (BIBSYS (Norway)) · Cited by 1
Distributed Subgradient Projection Algorithm over Directed Graphs: Alternate ProofPreprint
Xin, R., Xi, C., & Khan, U. A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.07707 · Cited by 1
Pang, C. H. J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.09516 · Cited by 1
Distributed Convex Optimization: Based on Monotone Operator Theory
Sherson, T. (2019) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:fb60dba0-e5f9-451e-b664-e3ca0d45b36b · Cited by 1
Coordination and Privacy Preservation in Multi-Agent Systems
Gao, H. (2020) · TigerPrints (Clemson University) · Cited by 1
Κουβελιώτης-Λυσίκατος, Ι. (2019) · doi:10.12681/eadd/45501 · Cited by 1
Accelerated distributed directed optimization with time delays
Kasagatta Ramesh, N. (2021) · Aaltodoc (Aalto University) · Cited by 1
Nash Equilibrium Seeking in Subnetwork Zero-Sum Games with Switching Communication Graphs.Preprint
Lou, Y., Hong, Y., Xie, L., Shi, G., & Johansson, K. H. (2013) · arXiv (Cornell University)
Consensus control for networks of agents with fixed topology and quantized communication
Li, D., Wang, J., & Yin, Z. (2013) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2013.6561173
Convergence analysis for quantized consensus of multi-agent systems with directed topologies
Li, D., Liu, Q., & Wang, X. (2012) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2012.6358064
Average-consensus in a two-time-scale Markov system
Topley, K. (2014) · cIRcle (University of British Columbia) · doi:10.14288/1.0165567
Optimization over directed graphs: Linear convergence rate
Xi, C., & Khan, U. A. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952958
Push-sum Algorithm on Time-varying Random Graphs
Rezaeinia, P. (2017) · QSpace (Queen's University Library)
Fault-tolerant Stochastic Distributed Systems
Silvestre, D. (2017) · Repositório Institucional da Universidade Autónoma de Lisboa (Universidade Autónoma de Lisboa)
A Proximal Gradient Algorithm for Composite Consensus Optimization over Directed Graphs
Zeng, J., He, T., Ouyang, S., Wang, M., & Chang, X. (2017) · IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems · doi:10.1109/cyber.2017.8446454
Distributed Training with Mobile Agents: Optimization Over Dynamic Directed Graphs
Saadatniaki, F., Xin, R., & Khan, U. A. (2019) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2019.8755589
Általánosított relatív konszenzus : Éles konvergenciatételek
Gerencsér, B. S., & Gerencsér, L. (2020) · Alkalmazott Matematikai Lapok · doi:10.37070/aml.2020.37.2.10
Optimal and resilient management of distributed energy resources
Zholbaryssov, M. (2019) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Non asymptotic bounds in asynchronous sum-weight gossip protocolsPreprint
Picard, D., Fellus, J., & Garnier, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.10248
Distributed Unsupervised Pattern Learning for Constrained Sensor Network
Chen, Z., & Hao, Q. (2022) · doi:10.1145/3512850.3512857
Know your audience: Communication model and computability in anonymous networksPreprint
Charron-Bost, B., & Lambein-Monette, P. (2023) · HAL
A Fault-Tolerant Distributed Termination Method for Distributed Optimization AlgorithmsPreprint
Alkhraijah, M., & Molzahn, D. K. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2401.16595
Decentralized Optimization in Time-Varying Networks with Arbitrary DelaysPreprint
Ortega, T., & Jafarkhani, H. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2405.19513
Brief Announcement: Know Your Audience
Charron-Bost, B., & Lambein-Monette, P. (2024) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3662158.3662784
Notes on Linear Gossip Algorithms: Potentials and Challenges
Gerencsér, B. S., & Gerencsér, L. (2025) · Journal of Systems Science and Complexity · doi:10.1007/s11424-025-4534-4
Neupane, K., Tseng, L., & Aloqaily, M. (2025) · Intelligent Cybersecurity Conference (ICSC) · doi:10.1109/icsc65596.2025.11140282
Gerencsér, B. S., & Kornyik, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.16601
Shadow Banning in Directed Graphs for Fault-Tolerant Averaging
Hadjicostis, C. N., & Domínguez-García, A. D. (2025) · European Control Conference (ECC) · doi:10.23919/ecc65951.2025.11187028
Κουβελιώτης-Λυσίκατος, Ι. (2020) · DSpace - NTUA (National Technical University of Athens) · doi:10.26240/heal.ntua.18668
Distributed Optimization in Networked Systems
Ebrahimi, Z. (2025) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/31437
Efficient algorithms for distributed learning, optimization and belief systems over networks
Meneses, C. A. U. (2018) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Aggregated Conditional Gradient Method for Decentralized Constrained Learning From Non-IID Data
Francis, R., & Chepuri, S. P. (2026) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2026.3659466
Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed GraphsPreprint
Liang, Y., Sun, Y., Cao, X., & Shen, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.20567
Convergence of broadcast gossip algorithms with random delays
Tian, Y., & Zong, S. (2026) · International Journal of Systems Science · doi:10.1080/00207721.2026.2675396
Convergence Rate Analysis of Ratio Consensus Algorithms with Column-Allowable MatricesPreprint
Gerencsér, B., & Szemerédi, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.28455
Privacy-Preserving Average Consensus: from a Node Decomposition Perspective
Xie, M., Wang, H., Gao, Y., Hu, Q., & Li, D. S. (2026) · International Symposium on Autonomous Systems (ISAS) · doi:10.1109/icaisisas68969.2026.11567677
Distributed Consensus, Optimization, and Learning under Communication ConstraintsPreprint
Chen, Z., Michelusi, N., Charalambous, T., & Huang, K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.06524
Metadata
- Authors
- Benezit, F., Blondel, V., Thiran, P., Tsitsiklis, J., & Vetterli, M.
- Affiliations
- École Polytechnique Fédérale de Lausanne (CH)
- Massachusetts Institute of Technology (US)
- Venue
- 2010 IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 1753-1757
- OpenAlex
- W2135674292
- Cited by
- 224
- References
- 16
- Citations by year
- 2026: 3 · 2025: 5 · 2024: 11 · 2023: 9 · 2022: 12 · 2021: 14 · 2020: 15 · 2019: 20 · 2018: 26 · 2017: 16 · 2016: 17 · 2015: 17 · 2014: 16 · 2013: 11 · 2012: 24
- FWCI
- 12.40
- Type
- conference paper
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- cc-by-nc
- Locations
- IEEE International Symposium on Information Theory (ISIT) (publishedVersion)
- Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- Funders
- National Science Foundation (0701623)
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (67322)
- Division of Electrical, Communications and Cyber Systems
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Physical Sciences › Computer Science › Signal Processing › Advanced Adaptive Filtering Techniques
- Keywords
- distributed averaging, directed graphs, convergence
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.