A combined algorithm for analyzing structural controllability and observability of complex networks

Úbeda Medina, Luis and Herrera Yagüe, Carlos and Barriales Valbuena, Iker and Zufiria Zatarain, Pedro Jose and Congosto Martínez, Mariluz (2013). A combined algorithm for analyzing structural controllability and observability of complex networks. In: "10th International Conference on Scientific Computing (CSC'13 )", 22/07/2013 - 25/07/2013, Las Vegas, Nevada, EE.UU. pp. 172-177.

Description

Title: A combined algorithm for analyzing structural controllability and observability of complex networks
Author/s:
  • Úbeda Medina, Luis
  • Herrera Yagüe, Carlos
  • Barriales Valbuena, Iker
  • Zufiria Zatarain, Pedro Jose
  • Congosto Martínez, Mariluz
Item Type: Presentation at Congress or Conference (Article)
Event Title: 10th International Conference on Scientific Computing (CSC'13 )
Event Dates: 22/07/2013 - 25/07/2013
Event Location: Las Vegas, Nevada, EE.UU
Title of Book: 10th International Conference on Scientific Computing (CSC'13 )
Date: 2013
Subjects:
Freetext Keywords: Complex networks, controllability, observability, maximum matching, Twitter
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

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (4MB) | Preview

Abstract

In this paper a combined algorithm for analyzing structural controllability and observability of complex networks is presented. The algorithm addresses the two fundamental properties to guarantee structural controllability of a system: the absence of dilations and the accessibility of all nodes. The first problem is reformulated as a Maximum Matching search and it is addressed via the Hopcroft- Karp algorithm; the second problem is solved via a new wiring algorithm. Both algorithms can be combined to efficiently determine the number of required controllers and observers as well as the new required connections in order to guarantee controllability and observability in real complex networks. An application to a Twitter social network with over 100,000 nodes illustrates the proposed algorithms.

More information

Item ID: 30136
DC Identifier: http://oa.upm.es/30136/
OAI Identifier: oai:oa.upm.es:30136
Deposited by: Memoria Investigacion
Deposited on: 02 Aug 2014 11:33
Last Modified: 22 Apr 2016 00:26
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM