On the effects of memory and topology on the controllability of complex dynamical networks

Panagiotis Kyriakis,Paul Bogdan,Sérgio Pequito

doi:10.1038/s41598-020-74269-5

Panagiotis Kyriakis, Paul Bogdan + Show 1 more

Open Access

https://doi.org/10.1038/s41598-020-74269-5

Copy DOI

Abstract

Recent advances in network science, control theory, and fractional calculus provide us with mathematical tools necessary for modeling and controlling complex dynamical networks (CDNs) that exhibit long-term memory. Selecting the minimum number of driven nodes such that the network is steered to a prescribed state is a key problem to guarantee that complex networks have a desirable behavior. Therefore, in this paper, we study the effects of long-term memory and of the topological properties on the minimum number of driven nodes and the required control energy. To this end, we introduce Gramian-based methods for optimal driven node selection for complex dynamical networks with long-term memory and by leveraging the structure of the cost function, we design a greedy algorithm to obtain near-optimal approximations in a computationally efficiently manner. We investigate how the memory and topological properties influence the control effort by considering Erdős–Rényi, Barabási–Albert and Watts–Strogatz networks whose temporal dynamics follow a fractional order state equation. We provide evidence that scale-free and small-world networks are easier to control in terms of both the number of required actuators and the average control energy. Additionally, we show how our method could be applied to control complex networks originating from the human brain and we discover that certain brain cortex regions have a stronger impact on the controllability of network than others.

Highlights

Recent advances in network science, control theory, and fractional calculus provide us with mathematical tools necessary for modeling and controlling complex dynamical networks (CDNs) that exhibit long-term memory
There has been an interplay between network science and control theory mainly due to the fact that many natural and man-made systems, such as the power grid, the World-Wide-Web, neural and biological networks can be described by complex dynamical networks (CDNs)
Order Complex Dynamical Networks (FOCDNs) where the adjacency matrix is given by three different wellknown models: the Erdős–Rényi (ER) model, the Barabási–Albert (BA) model and the Watts–Strogatz (WS)

Summary

Introduction

Recent advances in network science, control theory, and fractional calculus provide us with mathematical tools necessary for modeling and controlling complex dynamical networks (CDNs) that exhibit long-term memory. In this paper, we study the effects of long-term memory and of the topological properties on the minimum number of driven nodes and the required control energy. To this end, we introduce Gramian-based methods for optimal driven node selection for complex dynamical networks with long-term memory and by leveraging the structure of the cost function, we design a greedy algorithm to obtain near-optimal approximations in a computationally efficiently manner. odel2), both of which are considered developments that follow the notion of the classical Erdős–Rényi random graph m

Objectives

Methods

Results

Conclusion