When does a digraph admit a doubly stochastic adjacency matrix?

Digraphs with doubly stochastic adjacency matrices play an essential role in a variety of cooperative control problems including distributed averaging, optimization, and gossiping. In this paper, we fully characterize the class of digraphs that admit an edge weight assignment that makes the digraph adjacency matrix doubly stochastic. As a by-product of our approach, we also unveil the connection between weight-balanced and doubly stochastic adjacency matrices. Several examples illustrate our results.

[1]  Loh Hooi-Tong,et al.  On a Class of Directed Graphs - With an Application to Traffic-Flow Problems , 1970, Oper. Res..

[2]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

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

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

[5]  C. Wu.  Algebraic connectivity of directed graphs , 2005 .

[6]  Long Wang,et al.  Virtual Leader Approach to Coordinated Control of Multiple Mobile Agents with Asymmetric Interactions , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[7]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[8]  Stephen P. Boyd,et al.  Upper bounds on algebraic connectivity via convex optimization , 2006 .

[9]  Jiangping Hu,et al.  Leader-following coordination of multi-agent systems with coupling time delays , 2007, 0705.0401.

[10]  Ming Cao,et al.  Topology design for fast convergence of network consensus algorithms , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[11]  Dongjun Lee,et al.  Stable Flocking of Multiple Inertial Agents on Balanced Graphs , 2007, IEEE Transactions on Automatic Control.

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

[13]  Jorge Cortés,et al.  Distributed algorithms for reaching consensus on general functions , 2008, Autom..

[14]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[15]  Mikael Johansson,et al.  A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems , 2009, SIAM J. Optim..

[16]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[17]  J. Cortés,et al.  Distributed strategies for making a digraph weight-balanced , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  B. Anderson,et al.  The Contraction Coefficient of a Complete Gossip Sequence , 2010 .

[19]  Sonia Martínez,et al.  On Distributed Convex Optimization Under Inequality and Equality Constraints , 2010, IEEE Transactions on Automatic Control.