A note on the consensus finding problem in communication networks with switching topologies

Handle URI:
http://hdl.handle.net/10754/563541
Title:
A note on the consensus finding problem in communication networks with switching topologies
Authors:
Haskovec, Jan
Abstract:
In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates. We formulate sufficient conditions for consensus finding in terms of strong connectivity of the underlying directed graphs and prove that, given these conditions, consensus is found asymptotically. Moreover, we show that this consensus is an emergent property of the system, being encoded in its dynamics and not just an invariant of its initial configuration. © 2014 © 2014 Taylor & Francis.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
Informa UK Limited
Journal:
Applicable Analysis
Issue Date:
7-May-2014
DOI:
10.1080/00036811.2014.911844
ARXIV:
arXiv:1405.0971
Type:
Article
ISSN:
00036811
Additional Links:
http://arxiv.org/abs/arXiv:1405.0971v1
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorHaskovec, Janen
dc.date.accessioned2015-08-03T11:54:02Zen
dc.date.available2015-08-03T11:54:02Zen
dc.date.issued2014-05-07en
dc.identifier.issn00036811en
dc.identifier.doi10.1080/00036811.2014.911844en
dc.identifier.urihttp://hdl.handle.net/10754/563541en
dc.description.abstractIn this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates. We formulate sufficient conditions for consensus finding in terms of strong connectivity of the underlying directed graphs and prove that, given these conditions, consensus is found asymptotically. Moreover, we show that this consensus is an emergent property of the system, being encoded in its dynamics and not just an invariant of its initial configuration. © 2014 © 2014 Taylor & Francis.en
dc.publisherInforma UK Limiteden
dc.relation.urlhttp://arxiv.org/abs/arXiv:1405.0971v1en
dc.subjectcommunication networksen
dc.subjectconsensus problemsen
dc.subjectdirected graphsen
dc.subjectgraph Laplaciansen
dc.subjectswitching systemsen
dc.titleA note on the consensus finding problem in communication networks with switching topologiesen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalApplicable Analysisen
dc.identifier.arxividarXiv:1405.0971en
kaust.authorHaskovec, Janen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.