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

A. Yasin Yazicioglu, Magnus Egerstedt, Jeff S. Shamma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations


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.
Original languageEnglish (US)
Title of host publication53rd IEEE Conference on Decision and Control
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages6
ISBN (Print)9781467360906
StatePublished - Feb 17 2015

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01


Dive into the research topics of 'Decentralized formation of random regular graphs for robust multi-agent networks'. Together they form a unique fingerprint.

Cite this