On the Connectivity of Unions of Random Graphs

arXiv1703.07804MaRDI QIDQ6284697FDOQ6284697

Publication date: 22 March 2017

Abstract: Graph-theoretic tools and techniques have seen wide use in the multi-agent systems literature, and the unpredictable nature of some multi-agent communications has been successfully modeled using random communication graphs. Across both network control and network optimization, a common assumption is that the union of agents' communication graphs is connected across any finite interval of some prescribed length, and some convergence results explicitly depend upon this length. Despite the prevalence of this assumption and the prevalence of random graphs in studying multi-agent systems, to the best of our knowledge, there has not been a study dedicated to determining how many random graphs must be in a union before it is connected. To address this point, this paper solves two related problems. The first bounds the number of random graphs required in a union before its expected algebraic connectivity exceeds the minimum needed for connectedness. The second bounds the probability that a union of random graphs is connected. The random graph model used is the ErdH{o}s-R'enyi model, and, in solving these problems, we also bound the expectation and variance of the algebraic connectivity of unions of such graphs. Numerical results for several use cases are given to supplement the theoretical developments made.

This page was built for publication: On the Connectivity of Unions of Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284697)