Pasar al contenido principal

GESTION DE CAMBIOS PUNTUALES: SENSADO ACTIVO Y APRENDIZAJE CONJUNTO

TEC2017-86921-C2-1-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE CANTABRIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Testing equality of multiple power spectral density matrices

  • Ramírez García, David
  • Romero González, Daniel
  • Vía Rodríguez, Javier
  • López Valcarce, Roberto
  • Santamaría Caballero, Ignacio
This paper studies the existence of optimal invariant detectors for determining whether P multivariate processes have the same power spectral density. This problem finds application in multiple fields, including physical layer security and cognitive radio. For Gaussian observations, we prove that the optimal invariant detector, i.e., the uniformly most powerful invariant test, does not exist. Additionally, we consider the challenging case of close hypotheses, where we study the existence of the locally most powerful invariant test (LMPIT). The LMPIT is obtained in the closed form only for univariate signals. In the multivariate case, it is shown that the LMPIT does not exist. However, the corresponding proof naturally suggests an LMPIT-inspired detector that outperforms previously proposed detectors., Comunidad de Madrid | Ref. CASI-CAM-CM (S2013/ICE-2845), Research Council of Norway | Ref. FRIPRO TOPPFORSK (250910/F20), Ministerio de Economía y Competitividad | Ref. TEC2015-69648-REDC, Ministerio de Economía y Competitividad | Ref. TEC2016-81900-REDT/AEI, Ministerio de Economía y Competitividad | Ref. TEC2015-69868-C2-1-R, Agencia Estatal de Investigación | Ref. TEC2016-76409-C2-2-R, Agencia Estatal de Investigación | Ref. TEC2016-75067-C4-4-R, Agencia Estatal de Investigación | Ref. TEC2017-86921-C2-1-R, Agencia Estatal de Investigación | Ref. TEC2017-86921-C2-2-R, Xunta de Galicia | Ref. GRC2013/009, Xunta de Galicia | Ref. GRC2013/009, Xunta de Galicia | Ref. ED431G/04
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Multiplex Decomposition of Non-Markovian Dynamics and the Hidden Layer Reconstruction Problem

  • Lacasa, L.
  • Mariño, I.P.
  • Miguez, J.
  • Nicosia, V.
  • Roldán, É.
  • Lisica, A.
  • Grill, S.W.
  • Gómez-Gardeñes, J.
Elements composing complex systems usually interact in several different ways, and as such, the interaction architecture is well modeled by a network with multiple layers - a multiplex network - where the system''s complex dynamics is often the result of several intertwined processes taking place at different levels. However, only in a few cases can such multilayered architecture be empirically observed, as one usually only has experimental access to such structure from an aggregated projection. A fundamental challenge is thus to determine whether the hidden underlying architecture of complex systems is better modeled as a single interaction layer or if it results from the aggregation and interplay of multiple layers. Assuming a prior of intralayer Markovian diffusion, here we show that by using local information provided by a random walker navigating the aggregated network, it is possible to determine, in a robust manner, whether these dynamics can be more accurately represented by a single layer or if they are better explained by a (hidden) multiplex structure. In the latter case, we also provide Bayesian methods to estimate the most probable number of hidden layers and the model parameters, thereby fully reconstructing its architecture. The whole methodology enables us to decipher the underlying multiplex architecture of complex systems by exploiting the non-Markovian signatures on the statistics of a single random walk on the aggregated network. In fact, the mathematical formalism presented here extends above and beyond detection of physical layers in networked complex systems, as it provides a principled solution for the optimal decomposition and projection of complex, non-Markovian dynamics into a Markov switching combination of diffusive modes. We validate the proposed methodology with numerical simulations of both (i) random walks navigating hidden multiplex networks (thereby reconstructing the true hidden architecture) and (ii) Markovian and non-Markovian continuous stochastic processes (thereby reconstructing an effective multiplex decomposition where each layer accounts for a different diffusive mode). We also state and prove two existence theorems guaranteeing that an exact reconstruction of the dynamics in terms of these hidden jump-Markov models is always possible for arbitrary finite-order Markovian and fully non-Markovian processes. Finally, we showcase the applicability of the method to experimental recordings from (i) the mobility dynamics of human players in an online multiplayer game and (ii) the dynamics of RNA polymerases at the single-molecule level.