The Forest Consensus Theorem

DOI10.1109/TAC.2014.2304369MaRDI QIDQ2983033zbMATH OpenOpenAlexFDO

Authors R. P. Agaev, Pavel Chebotarev

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/1301.1848

Mathematics Subject Classification ID

Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Asymptotic stability in control theory (93D20)

Abstract: We show that the limiting state vector in the differential model of consensus seeking with an arbitrary communication digraph is obtained by multiplying the eigenprojection of the Laplacian matrix of the model by the vector of initial states. Furthermore, the eigenprojection coincides with the stochastic matrix of maximum out-forests of the weighted communication digraph. These statements make the forests consensus theorem. A similar result for DeGroot's iterative pooling model requires the Cesaro (time-average) limit in the general case. The forests consensus theorem is useful for the analysis of consensus protocols.

Cited in

(7)

• On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
• Consensus in asynchronous multiagent systems. I: Asynchronous consensus models
• Models of latent consensus
• The projection method for continuous-time consensus seeking
• Problems and methods of network control
• On the properties of orthogonal projection method for reaching consensus
• On the boundary value of the time-delay and the asymptotic behavior of a continuous first-order consensus protocol

This page was built for publication: The Forest Consensus Theorem

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