Jorge Cortés


When does a digraph admit a doubly stochastic adjacency matrix?
B. Gharesifard, J. Cortés
Proceedings of the American Control Conference, Baltimore, Maryland, 2010, pp. 2440-2445


Digraphs with doubly stochastic adjacency matrices play an essential role in a variety of cooperative control problems including distributed averaging and optimization. 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.

pdf   |   ps.gz

Mechanical and Aerospace Engineering, University of California, San Diego
9500 Gilman Dr, La Jolla, California, 92093-0411

Ph: 1-858-822-7930
Fax: 1-858-822-3107

cortes at
Skype id: jorgilliyo