Tight bound for deciding convergence of consensus systems

Abstract We analyze the asymptotic convergence of all infinite products of matrices taken in a given finite set by looking only at finite or periodic products. It is known that when the matrices of the set have a common nonincreasing polyhedral norm, all infinite products converge to zero if and only if all infinite periodic products with period smaller than a certain value converge to zero. Moreover, bounds on that value are available (Lagarias and Wang, 1995). We provide a stronger bound that holds for both polyhedral norms and polyhedral seminorms. In the latter case, the matrix products do not necessarily converge to zero, but all trajectories of the associated system converge to a common invariant subspace. We prove that our bound is tight for all seminorms. Our work is motivated by problems in consensus systems , where the matrices are stochastic (nonnegative with rows summing to one), and hence always share a same common nonincreasing polyhedral seminorm. In that case, we also improve existing results.

[1]  K. Engel.  Sperner Theory , 1996 .

[2]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[3]  Bassam Bamieh,et al.  Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback , 2011, IEEE Transactions on Automatic Control.

[4]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[5]  Patrizio Colaneri,et al.  Optimal and MPC Switching Strategies for Mitigating Viral Mutation and Escape , 2011 .

[6]  Vincent D. Blondel,et al.  On the number of alpha-power-free binary words for 2alpha<=7/3 , 2009, Theor. Comput. Sci..

[7]  J. Tsitsiklis,et al.  The boundedness of all products of a pair of matrices is undecidable , 2000 .

[8]  H. Tijms,et al.  Exponential convergence of products of stochastic matrices , 1977 .

[9]  J. Lagarias,et al.  The finiteness conjecture for the generalized spectral radius of a set of matrices , 1995 .

[10]  Paul H. Siegel,et al.  On codes that avoid specified differences , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[11]  R. Olfati-Saber,et al.  Consensus Filters for Sensor Networks and Distributed Sensor Fusion , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[13]  Vincent D. Blondel,et al.  How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard , 2012, SIAM J. Control. Optim..

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

[15]  Fabian R. Wirth,et al.  A positive systems model of TCP-like congestion control: asymptotic results , 2006, IEEE/ACM Transactions on Networking.

[16]  Konrad Engel,et al.  Sperner Theory: Index , 1996 .

[17]  I. Daubechies,et al.  Sets of Matrices All Infinite Products of Which Converge , 1992 .

[18]  R. Jungers.  The Joint Spectral Radius: Theory and Applications , 2009 .

[19]  V. Müller.  On the joint spectral radius , 1997 .

[20]  G. Ziegler.  Lectures on Polytopes , 1994 .

[21]  Raphaël M. Jungers,et al.  Efficient Algorithms for the Consensus Decision Problem , 2014, SIAM J. Control. Optim..

[22]  Raphaël M. Jungers,et al.  On the number of a-power-free words for 2 < a < 7/3 , 2008 .

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