A graph-theoretic condition for global identifiability of weighted consensus networks

dc.contributor.author	Nabavi, Seyedbehzad
dc.contributor.author	Chakrabortty, Aranya
dc.date.accessioned	2019-01-14T08:52:39Z
dc.date.available	2019-01-14T08:52:39Z
dc.date.issued	2016-02
dc.identifier.issn	00189286
dc.identifier.uri	http://hdl.handle.net/123456789/6879
dc.description	p.497 - 502	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	in:IEEE Transactions on Automatic Control, Vol.61, n°2 (Fév.2016);
dc.subject	Markov, Processus de	en_US
dc.subject	Graphes, Théorie des	en_US
dc.subject	Contrôle réseau théorie (graphique	en_US
dc.title	A graph-theoretic condition for global identifiability of weighted consensus networks	en_US
dc.type	Article	en_US