Linear Consensus Algorithms Based on Balanced Asymmetric Chains

DOI10.1109/TAC.2015.2400657MaRDI QIDQ2982572zbMATH OpenFDO

Authors Sadegh Bolouki, Roland P. Malhamé

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

Matrix and operator functional equations (39B42) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Abstract: Multi agent consensus algorithms with update steps based on so-called balanced asymmetric chains, are analyzed. For such algorithms it is shown that (i) the set of accumulation points of states is finite, (ii) the asymptotic unconditional occurrence of single consensus or multiple consensuses is directly related to the property of absolute infinite flow for the underlying update chain. The results are applied to well known consensus models.

Cited in

(1)

• Bounded confidence opinion dynamics: a survey

This page was built for publication: Linear Consensus Algorithms Based on Balanced Asymmetric Chains

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