Distributed Averaging With Random Network Graphs and Noises

DOI10.1109/TIT.2018.2862161zbMath1432.60021arXiv1702.03478OpenAlexW2593132324MaRDI QIDQ4559579

Jiexiang Wang, Tao Li

Publication date: 4 December 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05)

Related Items (6)

Mean-square pinning control of fractional stochastic discrete-time complex networks ⋮ Event-triggered bipartite consensus for multi-agent systems subject to multiplicative and additive noises ⋮ Stochastic bipartite consensus with measurement noises and antagonistic information ⋮ Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes ⋮ Convergence of distributed gradient-tracking-based optimization algorithms with random graphs ⋮ Projected subgradient based distributed convex optimization with transmission noises

This page was built for publication: Distributed Averaging With Random Network Graphs and Noises