Generalized Sarymsakov Matrices

Within the set of stochastic, indecomposable, aperiodic (SIA) matrices, the class of Sarymsakov matrices is the largest known subset that is closed under matrix multiplication, and more critically whose compact subsets are all consensus sets. This paper shows that a larger subset with these two properties can be obtained by generalizing the standard definition for Sarymsakov matrices. The generalization is achieved by introducing the notion of the SIA index of a stochastic matrix, whose value is 1 for Sarymsakov matrices, and then exploring those stochastic matrices with larger SIA indices. In addition to constructing the larger set, this paper introduces another class of generalized Sarymsakov matrices, which contains matrices that are not SIA, and studies their products. Sufficient conditions are provided for an infinite product of matrices from this class, converging to a rank-one matrix. Finally, as an application of the results just described and to confirm their usefulness, a necessary and sufficient combinatorial condition, the “avoiding set condition,” for deciding whether or not a compact set of stochastic matrices is a consensus set is revisited. In addition, a necessary and sufficient combinatorial condition is established for deciding whether or not a compact set of doubly stochastic matrices is a consensus set.

[1]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[2]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[3]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

[4]  Michael Chertkov,et al.  Synchronization in complex oscillator networks and smart grids , 2012, Proceedings of the National Academy of Sciences.

[5]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[6]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

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

[8]  Ming Cao,et al.  Clustering in diffusively coupled networks , 2011, Autom..

[9]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[10]  Tamer Basar,et al.  Stability of discrete-time Altafini's model: A graphical approach , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[11]  Ming Cao,et al.  Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks? , 2012, IEEE Control Systems.

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

[13]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[14]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[15]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[16]  Tamer Basar,et al.  Internal stability of linear consensus processes , 2014, 53rd IEEE Conference on Decision and Control.

[17]  Sadegh Bolouki,et al.  Linear Consensus Algorithms Based on Balanced Asymmetric Chains , 2015, IEEE Transactions on Automatic Control.

[18]  E. Seneta.  Coefficients of ergodicity: structure and applications , 1979, Advances in Applied Probability.

[19]  Javad Lavaei,et al.  Quantized Consensus by Means of Gossip Algorithm , 2012, IEEE Transactions on Automatic Control.

[20]  D. Angeli,et al.  Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees , 2006, SIAM J. Control. Optim..

[21]  Ming Cao,et al.  Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms , 2014, IEEE Transactions on Automatic Control.

[22]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[23]  John N. Tsitsiklis,et al.  Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems , 2011, IEEE Transactions on Automatic Control.

[24]  J. Wolfowitz.  PRODUCTS OF INDECOMPOSABLE, APERIODIC, STOCHASTIC MATRICES1 , 2010 .

[25]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[26]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[27]  Behrouz Touri,et al.  On backward product of stochastic matrices , 2011, Autom..

[28]  Sekhar Tatikonda,et al.  Dynamic threshold models of collective action in social networks , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[29]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[30]  Tamer Basar,et al.  Game-Theoretic Analysis of the Hegselmann-Krause Model for Opinion Dynamics in Finite Dimensions , 2014, IEEE Transactions on Automatic Control.

[31]  Angelia Nedic,et al.  On Convergence Rate of Weighted-Averaging Dynamics for Consensus Problems , 2017, IEEE Transactions on Automatic Control.

[32]  Long Wang,et al.  Group consensus of multi-agent systems with undirected communication graphs , 2009, 2009 7th Asian Control Conference.

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

[34]  Karl Henrik Johansson,et al.  Products of generalized stochastic Sarymsakov matrices , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[35]  M. Degroot.  Reaching a Consensus , 1974 .

[36]  Claudio Altafini,et al.  Consensus Problems on Networks With Antagonistic Interactions , 2013, IEEE Transactions on Automatic Control.

[37]  Ziyang Meng,et al.  Behaviors of networks with antagonistic interactions and switching topologies , 2016, Autom..

[38]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[39]  Brian D. O. Anderson,et al.  Contractions for consensus processes , 2011, IEEE Conference on Decision and Control and European Control Conference.

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

[41]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[42]  Ji Liu,et al.  Design and analysis of distributed averaging with quantized communication , 2014, 53rd IEEE Conference on Decision and Control.

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

[44]  Karl Henrik Johansson,et al.  Structural Balance and Opinion Separation in Trust–Mistrust Social Networks , 2016, IEEE Transactions on Control of Network Systems.

[45]  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..

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

[47]  Julien M. Hendrickx,et al.  A lifting approach to models of opinion dynamics with antagonisms , 2014, 53rd IEEE Conference on Decision and Control.

[48]  John N. Tsitsiklis,et al.  A new condition for convergence in continuous-time consensus seeking systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

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

[50]  T. Sarymsakov.  Inhomogeneous Markov Chains , 1961 .

[51]  Eugene Seneta,et al.  A note on semigroups of regular stochastic matrices , 1990 .

[52]  Mathias Bürger,et al.  On the Robustness of Uncertain Consensus Networks , 2014, IEEE Transactions on Control of Network Systems.

[53]  Behrouz Touri,et al.  Product of Random Stochastic Matrices , 2011, IEEE Transactions on Automatic Control.

[54]  Behrouz Touri,et al.  On Approximations and Ergodicity Classes in Random Chains , 2010, IEEE Transactions on Automatic Control.

[55]  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..