On two approaches to analyzing consensus in complex networks

Recently there is a great interest in studying consensus and flocking problems by analyzing dynamics of linear interacting systems coupled via a complex network. Two approaches have emerged to study this problem. In one approach the system is analyzed via the theory of inhomogeneous Markov chains and consensus is related to weak ergodicity of Markov chains. More recently, consensus problems are studied with communication delays between the coupled systems and the approach used is based on paracontracting and pseudocontracting operators. The purpose of this paper is to illustrate the connections between these two approaches and show that under certain conditions they are in fact equivalent.

[1]  Belykh,et al.  One-dimensional map lattices: Synchronization, bifurcations, and chaotic structures. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[2]  J. Wolfowitz.  Products of indecomposable, aperiodic, stochastic matrices , 1963 .

[3]  Paul Manneville,et al.  Collective behaviors in coupled map lattices with local and nonlocal connections. , 1992, Chaos.

[4]  Gade,et al.  Synchronization of oscillators with random nonlocal connectivity. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[5]  Tianping Chen,et al.  Synchronization analysis of linearly coupled networks of discrete time systems , 2004 .

[6]  Panos J. Antsaklis,et al.  On communication requirements for multi-agent consensus seeking , 2006 .

[7]  J. Jost,et al.  Spectral properties and synchronization in coupled map lattices. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[9]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[10]  Hans Schneider,et al.  The convergence of general products of matrices and the weak ergodicity of Markov chains , 1999 .

[11]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[12]  Chai Wah Wu,et al.  Synchronization and convergence of linear dynamics in random directed networks , 2006, IEEE Transactions on Automatic Control.

[13]  A. Paz,et al.  Ergodic theorems for sequences of infinite stochastic matrices , 1967, Mathematical Proceedings of the Cambridge Philosophical Society.

[14]  Chai Wah Wu,et al.  Global synchronization in coupled map lattices , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[15]  Chai Wah Wu.  Agreement and consensus problems in groups of autonomous agents with linear dynamics , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[16]  K. Kaneko.  Overview of coupled map lattices. , 1992, Chaos.

[17]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[18]  Chai Wah Wu.  On some properties of contracting matrices , 2008 .

[19]  Yangfeng Su,et al.  Convergence of Pseudocontractions and Applications to Two-stage and Asynchronous Multisplitting for Singular M-Matrices , 2000, SIAM J. Matrix Anal. Appl..

[20]  M. Neumann,et al.  Generalizations of the projection method with applications to SOR theory for hermitian positive semidefinite linear systems , 1987 .

[21]  Kaneko.  Chaotic but regular posi-nega switch among coded attractors by cluster-size variation. , 1989, Physical review letters.

[22]  E. Seneta,et al.  On the historical development of the theory of finite inhomogeneous Markov chains , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[23]  L. Elsner,et al.  Convergence of infinite products of matrices and inner-outer iteration schemes , 1994 .

[24]  Ming Cao,et al.  COORDINATION OF AN ASYNCHRONOUS MULTI-AGENT SYSTEM VIA AVERAGING , 2005 .

[25]  C. Wu.  On bounds of extremal eigenvalues of irreducible and m-reducible matrices , 2005 .

[26]  M. Bartlett,et al.  Weak ergodicity in non-homogeneous Markov chains , 1958, Mathematical Proceedings of the Cambridge Philosophical Society.

[27]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.