Identifiability in Continuous Lyapunov Models

From MaRDI portal
Publication:6183451

DOI10.1137/22M1520311arXiv2209.03835OpenAlexW4389311747MaRDI QIDQ6183451FDOQ6183451


Authors: Roser Homs, Mathias Drton, Niels Richard Hansen, Carlos Enrique Améndola Cerón Edit this on Wikidata


Publication date: 4 January 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: The recently introduced graphical continuous Lyapunov models provide a new approach to statistical modeling of correlated multivariate data. The models view each observation as a one-time cross-sectional snapshot of a multivariate dynamic process in equilibrium. The covariance matrix for the data is obtained by solving a continuous Lyapunov equation that is parametrized by the drift matrix of the dynamic process. In this context, different statistical models postulate different sparsity patterns in the drift matrix, and it becomes a crucial problem to clarify whether a given sparsity assumption allows one to uniquely recover the drift matrix parameters from the covariance matrix of the data. We study this identifiability problem by representing sparsity patterns by directed graphs. Our main result proves that the drift matrix is globally identifiable if and only if the graph for the sparsity pattern is simple (i.e., does not contain directed two-cycles). Moreover, we present a necessary condition for generic identifiability and provide a computational classification of small graphs with up to 5 nodes.


Full work available at URL: https://arxiv.org/abs/2209.03835




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Identifiability in Continuous Lyapunov Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183451)