Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate

DOI10.1109/TAC.2019.2929206MaRDI QIDQ5125546zbMATH OpenWikidataFDO

Authors Pouya Rezaienia, Bahman Gharesifard, Behrouz Touri, Tamás Linder

Publication date 7 October 2020

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(5)

• Push is Fast on Sparse Random Graphs
• A Unified Framework for Continuous-Time Unconstrained Distributed Optimization
• Push-sum on random graphs
• Convergence rate of Markov chains over switching distance regular networks
• Secure target tracking algorithm for multi-agent network over randomly packet lossy channels against eavesdropper

This page was built for publication: Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate

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