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

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

Research output: Contribution to journalConference articlepeer-review

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)
Article number7039446
Pages (from-to)595-600
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Issue numberFebruary
StatePublished - 2014
Externally publishedYes
Event2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 - Los Angeles, United States
Duration: Dec 15 2014Dec 17 2014

Bibliographical note

Publisher Copyright:
© 2014 IEEE.


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