Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs

DOI10.1109/TSP.2013.2264056zbMath1393.68022arXiv1208.4895MaRDI QIDQ4578670

Shaochuan Wu, Michael G. Rabbat

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Distributed web hacking by adaptive consensus-based reinforcement learning ⋮ Convergence of gossip algorithms for consensus in wireless sensor networks with intermittent links and mobile nodes

This page was built for publication: Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs