Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

A. Yasin Yazicioǧlu, Magnus Egerstedt, Jeff S. Shamma

Research output: Contribution to journalArticlepeer-review

39 Scopus citations


Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.
Original languageEnglish (US)
Pages (from-to)139-151
Number of pages13
JournalIEEE Transactions on Network Science and Engineering
Issue number4
StatePublished - Nov 25 2015


Dive into the research topics of 'Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs'. Together they form a unique fingerprint.

Cite this