Random asynchronous iterations in distributed coordination algorithms
From MaRDI portal
Publication:2280907
DOI10.1016/J.AUTOMATICA.2019.108505zbMATH Open1429.93328arXiv1804.10554OpenAlexW2968989966WikidataQ127375112 ScholiaQ127375112MaRDI QIDQ2280907FDOQ2280907
Jin-Hu Lü, Yao Chen, Weiguo Xia, Ming Cao
Publication date: 19 December 2019
Published in: Automatica (Search for Journal in Brave)
Abstract: Distributed coordination algorithms (DCA) carry out information processing processes among a group of networked agents without centralized information fusion. Though it is well known that DCA characterized by an SIA (stochastic, indecomposable, aperiodic) matrix generate consensus asymptotically via synchronous iterations, the dynamics of DCA with asynchronous iterations have not been studied extensively, especially when viewed as stochastic processes. This paper aims to show that for any given irreducible stochastic matrix, even non-SIA, the corresponding DCA lead to consensus successfully via random asynchronous iterations under a wide range of conditions on the transition probability. Particularly, the transition probability is neither required to be independent and identically distributed, nor characterized by a Markov chain.
Full work available at URL: https://arxiv.org/abs/1804.10554
Recommendations
- Asymptotic agreement and convergence of asynchronous stochastic algorithms
- Convergence analysis of asynchronous linear iterations with stochastic delays
- Asynchronous stochastic approximation algorithms for networked systems: regime-switching topologies and multiscale structure
- Asynchronous Stochastic Approximations
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
Distributed algorithms (68W15) Stochastic systems in control theory (general) (93E03) Consensus (93D50)
Cites Work
- Agreeing Asynchronously
- Consensus Seeking Over Random Weighted Directed Graphs
- Reaching a Consensus
- Non-negative matrices and Markov chains. 2nd ed
- Consensus condition for linear multi-agent systems over randomly switching topologies
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Convergence results for the linear consensus problem under Markovian random graphs
- Distributed Optimization Over Time-Varying Directed Graphs
- Consensus Over Ergodic Stationary Graph Processes
- On the possibility and impossibility of achieving clock synchronization
- Stability of discrete-time linear systems with Markovian jumping parameters
- Product of Random Stochastic Matrices
- Title not available (Why is that?)
- Generalized Sarymsakov Matrices
- On backward product of stochastic matrices
- How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard
- Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion
- Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
Cited In (7)
- Random Node-Asynchronous Updates on Graphs
- Data Collection in Population Protocols with Non-uniformly Random Scheduler
- Title not available (Why is that?)
- A two-layer model for coevolving opinion dynamics and collective decision-making in complex social systems
- Data collection in population protocols with non-uniformly random scheduler
- Mathematical models of self-appraisal in social networks
- Title not available (Why is that?)
This page was built for publication: Random asynchronous iterations in distributed coordination algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280907)
