Controllability of complex networks with unilateral inputs
Abstract In this paper, we study the problem of controlling complex networks with unilateral controls, i.e., controls which can assume only positive or negative values, not both. Given a complex network represented by the adjacency matrix A, an algorithm is developed that constructs an input matrix...
Guardado en:
Autores principales: | , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/266e3875ae314917a6d516649ec87803 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:doaj.org-article:266e3875ae314917a6d516649ec87803 |
---|---|
record_format |
dspace |
spelling |
oai:doaj.org-article:266e3875ae314917a6d516649ec878032021-12-02T11:52:56ZControllability of complex networks with unilateral inputs10.1038/s41598-017-01846-62045-2322https://doaj.org/article/266e3875ae314917a6d516649ec878032017-05-01T00:00:00Zhttps://doi.org/10.1038/s41598-017-01846-6https://doaj.org/toc/2045-2322Abstract In this paper, we study the problem of controlling complex networks with unilateral controls, i.e., controls which can assume only positive or negative values, not both. Given a complex network represented by the adjacency matrix A, an algorithm is developed that constructs an input matrix B such that the resulting system (A, B) is controllable with a near minimal number of unilateral control inputs. This is made possible by a reformulation of classical conditions for controllability that casts the minimal unilateral input selection problem into well known optimization problems. We identify network properties that make unilateral controllability relatively easy to achieve as compared to unrestricted controllability. The analysis of the network topology for instance allows us to establish theoretical bounds on the minimal number of controls required. For various categories of random networks as well as for a number of real-world networks these lower bounds are often achieved by our heuristics.Gustav LindmarkClaudio AltafiniNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 7, Iss 1, Pp 1-14 (2017) |
institution |
DOAJ |
collection |
DOAJ |
language |
EN |
topic |
Medicine R Science Q |
spellingShingle |
Medicine R Science Q Gustav Lindmark Claudio Altafini Controllability of complex networks with unilateral inputs |
description |
Abstract In this paper, we study the problem of controlling complex networks with unilateral controls, i.e., controls which can assume only positive or negative values, not both. Given a complex network represented by the adjacency matrix A, an algorithm is developed that constructs an input matrix B such that the resulting system (A, B) is controllable with a near minimal number of unilateral control inputs. This is made possible by a reformulation of classical conditions for controllability that casts the minimal unilateral input selection problem into well known optimization problems. We identify network properties that make unilateral controllability relatively easy to achieve as compared to unrestricted controllability. The analysis of the network topology for instance allows us to establish theoretical bounds on the minimal number of controls required. For various categories of random networks as well as for a number of real-world networks these lower bounds are often achieved by our heuristics. |
format |
article |
author |
Gustav Lindmark Claudio Altafini |
author_facet |
Gustav Lindmark Claudio Altafini |
author_sort |
Gustav Lindmark |
title |
Controllability of complex networks with unilateral inputs |
title_short |
Controllability of complex networks with unilateral inputs |
title_full |
Controllability of complex networks with unilateral inputs |
title_fullStr |
Controllability of complex networks with unilateral inputs |
title_full_unstemmed |
Controllability of complex networks with unilateral inputs |
title_sort |
controllability of complex networks with unilateral inputs |
publisher |
Nature Portfolio |
publishDate |
2017 |
url |
https://doaj.org/article/266e3875ae314917a6d516649ec87803 |
work_keys_str_mv |
AT gustavlindmark controllabilityofcomplexnetworkswithunilateralinputs AT claudioaltafini controllabilityofcomplexnetworkswithunilateralinputs |
_version_ |
1718394913160167424 |