Controllability of a Class of Swarm Signaling Networks

TL;DR

This paper derives analytical formulas to determine the minimum number of driver nodes needed to control swarm signaling networks with specific degree distributions, validated by simulations.

Contribution

It introduces closed-form expressions for controlling a class of swarm networks with regular and bi-modal out-degree distributions, enhancing control theory in network science.

Findings

High accuracy of approximations validated by simulations

Effective control of networks with missing links

Applicability to networks with different degree distributions

Abstract

In this paper, we propose closed-form analytical expressions to determine the minimum number of driver nodes that is needed to control a specific class of networks. We consider swarm signaling networks with regular out-degree distribution where a fraction $p$ of the links is unavailable. We further apply our method to networks with bi-modal out-degree distributions. Our approximations are validated through intensive simulations. Results show that our approximations have high accuracy when compared with simulation results for both types of out-degree distribution.