Title :
When does a digraph admit a doubly stochastic adjacency matrix?
Author :
Bahman Gharesifard;Jorge Cortés
Author_Institution :
Department of Mechanical and Aerospace Engineering, University of California San Diego, USA
fDate :
6/1/2010 12:00:00 AM
Abstract :
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.
Keywords :
"Stochastic processes","Algorithm design and analysis","Sufficient conditions","Distributed control","Network topology","Convergence","Distributed algorithms","Lyapunov method","Delay effects","Aerospace engineering"
Conference_Titel :
American Control Conference (ACC), 2010
Print_ISBN :
978-1-4244-7426-4
DOI :
10.1109/ACC.2010.5530578
