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

Simple item page
dc.contributor.authorNabavi, Seyedbehzad
dc.contributor.authorChakrabortty, Aranya
dc.date.accessioned2019-01-14T08:52:39Z
dc.date.available2019-01-14T08:52:39Z
dc.date.issued2016-02
dc.descriptionp.497 - 502en_US
dc.identifier.issn00189286
dc.identifier.urihttp://hdl.handle.net/123456789/6879
dc.language.isoenen_US
dc.relation.ispartofseriesin:IEEE Transactions on Automatic Control, Vol.61, n°2 (Fév.2016);
dc.subjectMarkov, Processus deen_US
dc.subjectGraphes, Théorie desen_US
dc.subjectContrôle réseau théorie (graphiqueen_US
dc.titleA graph-theoretic condition for global identifiability of weighted consensus networksen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
res.pdf
Size:
24.66 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Articles de périodique