Full text
![[img]](http://oa.upm.es/style/images/fileicons/application_pdf.png) |
PDF
- Users in campus UPM only
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (123kB) |
An algorithm for controllability in complex networks
Citation
Úbeda Medina, Luis and Herrera Yagüe, Carlos and Barriales Valbuena, Iker and Zufiria Zatarain, Pedro Jose (2013). An algorithm for controllability in complex networks. "International Journal of Complex Systems in Science", v. 3 (n. 1); pp. 63-70. ISSN 2174-6036.
Description
| Title: | An algorithm for controllability in complex networks |
|---|---|
| Author/s: |
|
| Item Type: | Article |
| Título de Revista/Publicación: | International Journal of Complex Systems in Science |
| Date: | December 2013 |
| ISSN: | 2174-6036 |
| Volume: | 3 |
| Subjects: | |
| Freetext Keywords: | Complex networks, controllability, maximum matching |
| Faculty: | E.T.S.I. Telecomunicación (UPM) |
| Department: | Matemática Aplicada a las Tecnologías de la Información [hasta 2014] |
| Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
Abstract
In this paper structural controllability of complex networks is anyzed. A new algorithm is proposed which constructs a structural control scheme for a given network by avoiding the absence of dilations and by guaranteeing the accessibility of all nodes. Such accessibility is solved via a wiring procedure; this procedure, based on determining the non-accessible regions of the network, has been improved in this new proposed algorithm. This way, the number of dedicated controllers is reduced with respect to the one provided by previous existing algorithms.
More information
| Item ID: | 29476 |
|---|---|
| DC Identifier: | http://oa.upm.es/29476/ |
| OAI Identifier: | oai:oa.upm.es:29476 |
| Official URL: | http://www.ij-css.org/vol_03-01.html |
| Deposited by: | Memoria Investigacion |
| Deposited on: | 05 Jul 2014 07:41 |
| Last Modified: | 22 Sep 2014 11:45 |
