An algorithm for controllability in complex networks

Úbeda Medina, Luis, Herrera Yagüe, Carlos, Barriales Valbuena, Iker and Zufiria Zatarain, Pedro José ORCID: https://orcid.org/0000-0002-1217-1216 (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.

Descripción

Título: An algorithm for controllability in complex networks
Autor/es:
Tipo de Documento: Artículo
Título de Revista/Publicación: International Journal of Complex Systems in Science
Fecha: Diciembre 2013
ISSN: 2174-6036
Volumen: 3
Número: 1
Materias:
ODS:
Palabras Clave Informales: Complex networks, controllability, maximum matching
Escuela: E.T.S.I. Telecomunicación (UPM)
Departamento: Matemática Aplicada a las Tecnologías de la Información [hasta 2014]
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[thumbnail of INVE_MEM_2013_162712.pdf] PDF (Portable Document Format) - Acceso permitido solamente a usuarios en el campus de la UPM - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (123kB)

Resumen

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.

Más información

ID de Registro: 29476
Identificador DC: https://oa.upm.es/29476/
Identificador OAI: oai:oa.upm.es:29476
URL Oficial: http://www.ij-css.org/vol_03-01.html
Depositado por: Memoria Investigacion
Depositado el: 05 Jul 2014 07:41
Ultima Modificación: 25 Ene 2023 16:02