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 101–200 of 261
Accelerating the Decentralized Federated Learning via Manipulating Edges
Zhou, M., Liu, G., Lu, K., Mao, R., & Liao, H. (2024) · International World Wide Web Conference (WWW) · doi:10.1145/3589334.3645509 · Cited by 19
Asynchronous Subgradient-Push.Preprint
Assran, M., & Rabbat, M. (2018) · arXiv (Cornell University) · Cited by 19
Lanubile, A., Maschietto, V., Battilani, P., & Marocco, A. (2016) · Journal of Plant Interactions · doi:10.1080/17429145.2016.1274062 · Cited by 18
Experiments on Percolation of Information in Dark Markets
Asparouhova, E., & Bossaerts, P. L. (2017) · The Economic Journal · doi:10.1111/ecoj.12464 · Cited by 18
New broadcast based distributed averaging algorithm over wireless sensor networks
Iutzeler, F., Ciblat, P., Hachem, W., & Jakubowicz, J. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288575 · Cited by 17
A fast proximal gradient algorithm for decentralized composite optimization over directed networks
Zeng, J., He, T., & Wang, M. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.07.005 · Cited by 17
Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies
Saraswat, G., Khatana, V., Patel, S., & Salapaka, M. V. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3216286 · Cited by 17
Asynchronous decentralized optimization in heterogeneous systems
Rabbat, M., & Tsianos, K. I. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039532 · Cited by 16
Fully Asynchronous Push-Sum With Growing Intercommunication Intervals
Olshevsky, A., Paschalidis, I. C., & Spiridonoff, A. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431414 · Cited by 16
Average consensus on arbitrary strongly connected digraphs with dynamic topologies
Cai, K., & Ishii, H. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6314712 · Cited by 15
Resilient average consensus in the presence of heterogeneous packet dropping links
Hadjicostis, C. N., Domínguez-García, A. D., & Vaidya, N. H. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426666 · Cited by 15
Distributed learning of average belief over networks using sequential observations
Zhang, K., Liu, Y., Liu, J., Liu, M., & Başar, T. (2020) · Automatica · doi:10.1016/j.automatica.2020.108857 · Cited by 15
Qiao, C., Qiu, J., Tan, Z., Min, G., Zomaya, A. Y., & Tian, Z. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3186630 · Cited by 14
Naderi, S., & Blondin, M. J. (2023) · IEEE Access · doi:10.1109/access.2023.3341295 · Cited by 14
Computational Convergence Analysis of Distributed Optimization Algorithms for Directed Graphs
Zhang, S., Yi, X., George, J., & Yang, T. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899565 · Cited by 14
Asynchronous gossip principal components analysis
Fellus, J., Picard, D., & Gosselin, P.-H. (2015) · Neurocomputing · doi:10.1016/j.neucom.2014.11.076 · Cited by 14
Distributed optimization of strongly convex functions on directed time-varying graphs
Nedić, A., & Olshevsky, A. (2013) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2013.6736882 · Cited by 14
Vaidya, N. H., Hadjicostis, C. N., & Domínguez-García, A. D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.6392 · Cited by 14
Manitara, N. E., & Hadjicostis, C. N. (2014) · International Symposium on Communications, Control and Signal Processing · doi:10.1109/isccsp.2014.6877918 · Cited by 13
Distributed Optimization Over Networks
Nedić, A. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97142-1_1 · Cited by 13
Success and failure of adaptation-diffusion algorithms for consensus in multi-agent networks
Morral, G., Bianchi, P., & Fort, G. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039609 · Cited by 13
Decentralized K-Means Using Randomized Gossip Protocols for Clustering Large Datasets
Fellus, J., Picard, D., & Gosselin, P.-H. (2013) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2013.58 · Cited by 13
A Bayesian Framework for Distributed Estimation of Arrival Rates in Asynchronous Networks
Coluccia, A., & Notarstefano, G. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2557313 · Cited by 12
Discrete-Time distributed secondary control of DC microgrids with communication delays
Moradi, M., Heydari, M., Zarei, S. F., & Oshnoei, A. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2023.109935 · Cited by 12
Finite-time distributed averaging
Mou, S., & Morse, A. S. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859261 · Cited by 12
Distributed Average Consensus over Random Networks
Alaviani, S. S., & Elia, N. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815134 · Cited by 12
Domínguez-García, A. D., Hadjicostis, C. N., & Vaidya, N. H. (2011) · Defense Technical Information Center (DTIC) · doi:10.21236/ada558911 · Cited by 12
Information-Theoretic Privacy in Distributed Average ConsensusPreprint
Gupta, N., Katz, J. I., & Chopra, N. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.01794 · Cited by 12
Challenging issues of average consensus algorithms in wireless sensor networks
Khosravi, A., & Kavian, Y. S. (2016) · IET Wireless Sensor Systems · doi:10.1049/iet-wss.2015.0092 · Cited by 11
Resilient Privacy-Preserving Average Consensus for Multi-agent Systems under Attacks
Wang, D., Zheng, N., Xu, M., Wu, Y., Hu, Q., & Wang, G. (2020) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv50220.2020.9305459 · Cited by 11
Computing Outside the Box: Average Consensus over Dynamic Networks
Charron-Bost, B., & Lambein-Monette, P. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sand.2022.10 · Cited by 11
Carli, R., Notarstefano, G., Schenato, L., & Varagnolo, D. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7330916 · Cited by 11
Distributed Averaging in Opinion Dynamics
Berenbrink, P., Cooper, C., Gava, C., Marzagão, D. K., Mallmann-Trenn, F., Radzik, T., & Rivera, N. (2023) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3583668.3594593 · Cited by 10
Su, L. (2017) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 10
On the Convergence Rate of Average Consensus and Distributed optimization over Unreliable Networks
Su, L. (2018) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2018.8645184 · Cited by 10
Average Consensus in the Presence of Delays and Dynamically Changing Directed Graph TopologiesPreprint
Hadjicostis, C. N., & Charalambous, T. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.4778 · Cited by 10
Nedić, A. (2015) · Springer eBooks · doi:10.1007/978-1-4471-5058-9_219 · Cited by 10
Distributed Conjugate Gradient Method via Conjugate Direction Tracking
Shorinwa, O., & Schwager, M. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644588 · Cited by 9
Tight Bounds on the Convergence Rate of Generalized Ratio Consensus Algorithms
Gerencsér, B. S., & Gerencsér, L. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3067629 · Cited by 9
Fast Average Gossiping Under Asymmetric Links In Wsns
Asensio-Marco, C., & Beferull‐Lozano, B. (2014) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.43800 · Cited by 9
Fast distributed optimization over directed graphs
Xi, C., Wu, Q., & Khany, U. A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526694 · Cited by 9
Interaction-Based Distributed Learning in Cyber-Physical and Social Networks
Sasso, F., Coluccia, A., & Notarstefano, G. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2917715 · Cited by 9
Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
Kawamura, S., Cai, K., Ye, M., & Lin, Z. (2018) · International Journal of Control · doi:10.1080/00207179.2018.1535200 · Cited by 9
Toward Optimal Network Topology Design for Fast and Secure Distributed Computation
Liu, J., & Başar, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12601-2_13 · Cited by 8
Subgradient-Push Is of the Optimal Convergence Rate
Lin, Y., & Liu, J. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992842 · Cited by 8
Average-Consensus in a Deterministic Framework—Part I: Strong Connectivity
Topley, K., & Krishnamurthy, V. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2215603 · Cited by 8
Averaging Over General Random Networks
Cai, K. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199181 · Cited by 7
Coluccia, A., & Notarstefano, G. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.02596 · Cited by 7
Distributed quantized consensus for agents on directed networks
Li, D., Liu, Q., & Wang, X. (2013) · Journal of Systems Science and Complexity · doi:10.1007/s11424-013-1020-1 · Cited by 7
Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging With Noisy Links
Noorshams, N., & Wainwright, M. J. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2122241 · Cited by 7
Zhang, P., Hu, C., Wu, S., Gong, R., & Luo, Z. (2021) · IEEE Access · doi:10.1109/access.2021.3108639 · Cited by 7
Distributed Bayesian estimation of arrival rates in asynchronous monitoring networks
Coluccia, A., & Notarstefano, G. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6854564 · Cited by 7
Average consensus-based asynchronous tracking
Katragadda, S., Regazzoni, C. S., & Cavallaro, A. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952988 · Cited by 7
Alaviani, S. S. (2019) · Iowa State University Digital Repository (Iowa State University) · Cited by 7
Dynamic Average Diffusion With Randomized Coordinate Updates
Ying, B., Yuan, K., & Sayed, A. H. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2019.2942191 · Cited by 7
Distributed stopping for average consensus using double linear iterative strategies
Manitara, N. E., & Hadjicostis, C. N. (2014) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2014.7028528 · Cited by 7
Request-based gossiping without deadlocks
Liu, J., Mou, S., Morse, A. S., Anderson, B. D. O., & Yu, C. B. (2018) · Automatica · doi:10.1016/j.automatica.2018.03.001 · Cited by 6
Consensus with linear objective maps
Chen, X., Belabbas, M.-A., & Başar, T. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402648 · Cited by 6
Distributed algorithms for the average bridge consensus
Mou, S., García, E., & Casbeer, D. W. (2017) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta.2017.8062703 · Cited by 6
Distributed estimation and optimization in asynchronous networks
Iutzeler, F. (2013) · theses.fr (ABES) · doi:10.70675/3bc3906azc7fez413az854aze520767f5dd7 · Cited by 6
An Analysis Tool for Push-Sum-Based Distributed Optimization
Lin, Y., Zhu, Z., & Liu, J. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3596669 · Cited by 5
Distributed aggregative optimization over directed networks with column-stochasticity
Zhou, Q., Zhang, K., Zhou, H., Lü, Q., Liao, X., & Li, H. (2024) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2024.107492 · Cited by 5
Quantized consensus for agents on digraphs
Li, D., Liu, Q., & Wang, X. (2011) · International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) · doi:10.1109/fskd.2011.6019964 · Cited by 5
Vector-valued gossip over w-holonomic networks
Bayram, E., Belabbas, M.-A., & Başar, T. (2026) · Automatica · doi:10.1016/j.automatica.2026.113288 · Cited by 5
Compressed Sensing in Wireless Sensor Networks Without Explicit Position Information
Lindberg, C., Amat, A. G. I., & Wymeersch, H. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2623091 · Cited by 5
Asynchronous Distributed Clustering Algorithm for Wireless Sensor Networks
Qiao, C., & Brown, K. N. (2019) · International Conference on Machine Learning Technologies (ICMLT) · doi:10.1145/3340997.3341007 · Cited by 5
Consensus Control for Directed Networks Under Quantized Information Exchange
Yin, Z., Huang, Y., Geng, X., & Li, D. (2014) · Asian Journal of Control · doi:10.1002/asjc.1080 · Cited by 5
Dynamics Based Privacy Protection for Average Consensus on Directed GraphsPreprint
Gao, H. B., & Wang, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.02255 · Cited by 5
DC-DistADMM: ADMM Algorithm for Contsrained Distributed Optimization over Directed GraphsPreprint
Khatana, V., & Salapaka, M. V. (2020) · arXiv (Cornell University) · Cited by 5
Decentralized Hyper-Gradient Computation over Time-Varying Directed NetworksPreprint
Terashita, N., & Hara, S. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2210.02129 · Cited by 5
Row-Stochastic Matrices Based Distributed Optimization Algorithm With Uncoordinated Step-Sizes
Li, H., Wang, J., & Wang, Z. (2019) · International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS) · doi:10.1109/iccss48103.2019.9115478 · Cited by 4
Delay-Tolerant Distributed Algorithms for Decision-Making in Vehicular Networks
Chen, Z., Hao, Q., Huang, H., & Qiao, C. (2023) · Asia Pacific Journal of Operational Research · doi:10.1142/s0217595923400043 · Cited by 4
Decentralized Optimization in Networks with Arbitrary Delays
Ortega, T., & Jafarkhani, H. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10622164 · Cited by 4
An Averaging Method for Synchronization in Kuramoto Models
Okaniwa, M., & Ishii, H. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120914-2-us-4030.00071 · Cited by 4
Microgrid Distributed Frequency Control Over Time-Varying Communication Networks
Zholbaryssov, M., & Domínguez-García, A. D. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619398 · Cited by 4
Chen, X., Belabbas, M.-A., & Liu, J. (2021) · Automatica · doi:10.1016/j.automatica.2021.110088 · Cited by 4
Low Complexity Convergence Rate Bounds for the Synchronous Gossip Subclass of Push-Sum Algorithms
Gerencsér, B. S., & Kornyik, M. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3407997 · Cited by 4
Cross-Layer MAC Protocol for Unbiased Average Consensus Under Random Interference
Asensio-Marco, C., Alonso-Román, D., & Beferull‐Lozano, B. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2018.2873070 · Cited by 4
Decentralized Eigendecomposition for Online Learning over Graphs
Fan, Y., Trinh-Hoang, M., & Pesavento, M. (2021) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco54536.2021.9616034 · Cited by 4
Know your audiencePreprint
Charron-Bost, B., & Lambein-Monette, P. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2311.17728 · Cited by 4
Domínguez-García, A. D., Hadjicostis, C. N., & Vaidya, N. H. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.6391 · Cited by 4
Computable Convergence Rate Bound for Ratio Consensus Algorithms
Gerencsér, B. S. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3184655 · Cited by 3
Linear Convergence of Asynchronous Gradient Push Algorithm for Distributed Optimization
Li, H., Cheng, H., Lü, Q., Wang, Z., & Huang, T. (2024) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2024.3516936 · Cited by 3
A Distributed Model Predictive Control Algorithm of Linear Systems Over Time-Varying Directed Graphs
Jin, B., Li, H., & Yan, W. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865206 · Cited by 3
Hadjicostis, C. N., & Domínguez-García, A. D. (2024) · European Journal of Control · doi:10.1016/j.ejcon.2024.101035 · Cited by 3
Robust consensus for multi-agent systems over unbalanced directed networks
Li, D., Wang, X.-F., & Yin, Z. (2014) · Journal of Systems Science and Complexity · doi:10.1007/s11424-014-1191-4 · Cited by 3
Asymmetric Average Consensus Under Sinr-Based Interference
Asensio-Marco, C., & Beferull‐Lozano, B. (2012) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.42943 · Cited by 3
Distributed empirical risk minimization over directed graphs
Xin, R., Sahu, A. K., Kar, S., & Khan, U. A. (2019) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf44664.2019.9049065 · Cited by 3
Memory-Free Stochastic Weight Averaging by One-Way Variational Pruning
Wang, Y., Park, H., & Lee, J. (2021) · IEEE Signal Processing Letters · doi:10.1109/lsp.2021.3082036 · Cited by 3
Decentralized Eigendecomposition for Online Learning Over Graphs With Applications
Fan, Y., Trinh-Hoang, M., Ardıç, C. E., & Pesavento, M. (2023) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2023.3302658 · Cited by 3
Robust Multi-Agent Optimization: Coping with Packet-Dropping Link Failures.Preprint
Su, L., & Vaidya, N. H. (2016) · arXiv (Cornell University) · Cited by 3
Nedić, A. (2021) · Springer eBooks · doi:10.1007/978-3-030-44184-5_219 · Cited by 3
Robustified Distributed Average Consensus
Charalambous, T., Domínguez-García, A. D., & Hadjicostis, C. N. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-14081-5.00076-3 · Cited by 3
Tamuka, N., Mathonsi, T. E., Olwal, T. O., Maswikaneng, S. P., Muchenje, T., & Tshilongamulenzhe, T. M. (2026) · Future Internet · doi:10.3390/fi18020100 · Cited by 2
From Euclidean to Graph-Structured Data: A Survey of Collaborative Learning
Bourgerie, R., Girdzijauskas, Š., & Fodor, V. (2026) · Transactions on machine learning research · doi:10.48550/arxiv.2609.02984 · Cited by 2
Averaging Asynchronously Using Double Linear Iterations
Ji, L. H., & Stephen, A. (2012) · Cited by 2
Convergence Rate of Push-Sum Algorithms on Random Graphs
Rezaienia, P., Gharesifard, B., Linder, T., & Touri, B. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618933 · Cited by 2
Efficient Asynchronous GCN Training on a GPU Cluster
Zhang, Y., & Goswami, D. (2021) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads53394.2021.00086 · Cited by 2
Iterative approximate Byzantine consensus in arbitrary directed graphs
Tseng, L., Liang, G., & Vaidya, N. H. (2024) · Distributed Computing · doi:10.1007/s00446-024-00468-2 · Cited by 2
Dynamics Based Privacy Preservation for Average Consensus on Directed Graphs
Liu, Y., Gao, H. B., Du, J., & Zhi, Y. (2022) · Chinese Control Conference (CCC) · doi:10.23919/ccc55666.2022.9902828 · Cited by 2
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.