Distributed Averaging With Random Network Graphs and Noises

DOI10.1109/TIT.2018.2862161MaRDI QIDQ4559579zbMATH OpenOpenAlexWikidataFDO

Authors Tao Li, Jiexiang Wang

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

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

Abstract: We consider discrete-time distributed averaging algorithms over multi-agent networks with measurement noises and time-varying random graph flows. Each agent updates its state by relative states between neighbours with both additive and multiplicative measurement noises. The network structure is modeled by time-varying random digraphs, which may be spatially and temporally dependent. By developing difference inequalities of proper stochastic Lyapunov function, the algebraic graph theory and martingale convergence theory, we obtain sufficient conditions for stochastic approximation type algorithms to achieve mean square and almost sure average consensus. We prove that all states of agents converge to a common variable in mean square and almost surely if the graph flow is conditionally balanced and uniformly conditionally jointly connected. The mathematical expectation of the common variable is right the average of initial values, and the upper bound of the mean square steady-state error is given quantitatively related to the weights, the algorithm gain and the energy level of the noises.

Recommendations

• Averaging Over General Random Networks
• Distributed average consensus in digraphs
• Network-Based Consensus Averaging With General Noisy Channels
• Relative tempo of distributed averaging on networks
• Distributed estimation over complex networks
• Distributed averaging on digital erasure networks
• Distributed computation of exact average degree and network size in finite time under quantized communication
• Distributed algorithms for random graphs
• Stochastic analysis of average-based distributed algorithms
• Approximating the distribution functions in stochastic networks

Cited in

(13)

• Mean-square pinning control of fractional stochastic discrete-time complex networks
• Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
• Stochastic bipartite consensus with measurement noises and antagonistic information
• Multi-agent consensus with stopping rules under bounded measurement noise
• Event-triggered stochastic consensus of multiagent systems over random antagonistic network in a compound noisy environment
• Scaled consensus for MASs with compound noises over Markovian switched topologies
• Time-varying formation control for heterogeneous multi-agent systems with random network and measurement noise
• Containment control for multi-agent systems with random switched networks and compound noises
• Decentralized stochastic subgradient projection optimization algorithms over random networks
• Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes
• Event-triggered bipartite consensus for multi-agent systems subject to multiplicative and additive noises
• Projected subgradient based distributed convex optimization with transmission noises
• Distributed Averaging Via Lifted Markov Chains

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

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