Decentralized formation of random regular graphs for robust multi-agent networks

Handle URI:
http://hdl.handle.net/10754/550518
Title:
Decentralized formation of random regular graphs for robust multi-agent networks
Authors:
Yazicioglu, A. Yasin; Egerstedt, Magnus; Shamma, Jeff S. ( 0000-0001-5638-9551 )
Abstract:
Multi-agent networks are often modeled via interaction graphs, where the nodes represent the agents and the edges denote direct interactions between the corresponding agents. Interaction graphs have significant impact on the robustness of networked systems. One family of robust graphs is the random regular graphs. In this paper, we present a locally applicable reconfiguration scheme to build random regular graphs through self-organization. For any connected initial graph, the proposed scheme maintains connectivity and the average degree while minimizing the degree differences and randomizing the links. As such, if the average degree of the initial graph is an integer, then connected regular graphs are realized uniformly at random as time goes to infinity.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
IEEE
Journal:
Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on
Conference/Event name:
2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
Issue Date:
15-Dec-2014
DOI:
10.1109/CDC.2014.7039446
Type:
Conference Paper
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7039446
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorYazicioglu, A. Yasinen
dc.contributor.authorEgerstedt, Magnusen
dc.contributor.authorShamma, Jeff S.en
dc.date.accessioned2015-04-23T14:07:27Zen
dc.date.available2015-04-23T14:07:27Zen
dc.date.issued2014-12-15en
dc.identifier.doi10.1109/CDC.2014.7039446en
dc.identifier.urihttp://hdl.handle.net/10754/550518en
dc.description.abstractMulti-agent networks are often modeled via interaction graphs, where the nodes represent the agents and the edges denote direct interactions between the corresponding agents. Interaction graphs have significant impact on the robustness of networked systems. One family of robust graphs is the random regular graphs. In this paper, we present a locally applicable reconfiguration scheme to build random regular graphs through self-organization. For any connected initial graph, the proposed scheme maintains connectivity and the average degree while minimizing the degree differences and randomizing the links. As such, if the average degree of the initial graph is an integer, then connected regular graphs are realized uniformly at random as time goes to infinity.en
dc.publisherIEEEen
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7039446en
dc.rights(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.titleDecentralized formation of random regular graphs for robust multi-agent networksen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalDecision and Control (CDC), 2014 IEEE 53rd Annual Conference onen
dc.conference.date15 December 2014 through 17 December 2014en
dc.conference.name2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014en
dc.eprint.versionPost-printen
dc.contributor.institutionSchool of Electrical and Computer Engineering, Georgia Institute of Technologyen
dc.contributor.institutionSchool of Electrical and Computer Engineering, Georgia Institute of Technologyen
kaust.authorShamma, Jeff S.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.