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
Geographic gossip: efficient aggregation for sensor networks
Dimakis, A. G., Sarwate, A. D., & Wainwright, M. J. (2006) · Proceedings of the fifth international conference on Information processing in sensor networks - IPSN '06 · doi:10.1145/1127777.1127791 · Cited by 185
Order-Optimal Consensus Through Randomized Path Averaging
Bénézit, F., Dimakis, A. G., Thiran, P., & Vetterli, M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2060050 · Cited by 93
Self-citationWhen does a digraph admit a doubly stochastic adjacency matrix?
Gharesifard, B., & Cortes, J. (2010) · Proceedings of the 2010 American Control Conference · doi:10.1109/acc.2010.5530578 · Cited by 82
On distributed averaging algorithms and quantization effects
Nedić, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2008) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2008.4738891 · Cited by 63
Self-citationTahbaz-Salehi, A., & Jadbabaie, A. (2007) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2007.4434408 · Cited by 25
Local interference can accelerate gossip algorithms
Nazer, B., Dimakis, A. G., & Gastpar, M. (2008) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797612 · Cited by 15
Cited by
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
Kia, S. S., Scoy, B. V., Cortés, J., Freeman, R. A., Lynch, K., & Martínez, S. (2019) · IEEE Control Systems · doi:10.1109/mcs.2019.2900783 · Cited by 449
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
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.