Structural Identifiability in Non-Gaussian Graphical Discrete Lyapunov Models
Abstract
This paper studies the problem of structural identifiability for graphical discrete Lyapunov models in the non-Gaussian setting from observational data. A graphical discrete Lyapunov model associated with a graph G consists of the set of stationary distributions of stable first-order vector autoregressive models whose transition matrices have sparsity patterns determined by G. This model has a causal interpretation as G can be viewed as encoding dynamic causal relationships between random variables of interest. It has been shown that generic parameter identifiability holds for reflexive directed acyclic graphs (DAGs). Structural identifiability for these models remains unstudied beyond certain restrictive cases. In this work, we prove a non-constructive structural identifiability result for reflexive DAGs in non-Gaussian graphical discrete Lyapunov models by leveraging the information contained in the entire collection of stationary cumulants. We also provide a concrete algorithm for learning reflexive directed trees from stationary cumulants of orders ≤ 5.
Related
- Two Gaussians, Too Many: A bootstrap-based approach to assess identifiability in non-Gaussian structural vector autoregressions
- Degree of the Gaussian graphical model of the cycle
- Lyapunov-Schmidt reduction for periodic orbits of implicit discrete dynamical systems
- Fixed-Time ISS for Interconnected Discrete-Time Systems, Part I: Extinction-Based Lyapunov Functions
- Fixed-Time ISS for Interconnected Discrete-Time Systems, Part II: Finite-Horizon Lyapunov Functions
BibTeX
@misc{luo2026structural,
title = {{Structural Identifiability in Non-Gaussian Graphical Discrete Lyapunov Models}},
author = {Qixia Luo and Elina Robeva},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.25935},
eprint = {2610.25935},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.25935},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Structural Identifiability in Non-Gaussian Graphical Discrete Lyapunov Models
AU - Qixia Luo
AU - Elina Robeva
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.25935
UR - https://arxiv.org/abs/2610.25935
AB - This paper studies the problem of structural identifiability for graphical discrete Lyapunov models in the non-Gaussian setting from observational data. A graphical discrete Lyapunov model associated with a graph G consists of the set of stationary distributions of stable first-order vector autoregressive models whose transition matrices have sparsity patterns determined by G. This model has a causal interpretation as G can be viewed as encoding dynamic causal relationships between random variables of interest. It has been shown that generic parameter identifiability holds for reflexive directed acyclic graphs (DAGs). Structural identifiability for these models remains unstudied beyond certain restrictive cases. In this work, we prove a non-constructive structural identifiability result for reflexive DAGs in non-Gaussian graphical discrete Lyapunov models by leveraging the information contained in the entire collection of stationary cumulants. We also provide a concrete algorithm for learning reflexive directed trees from stationary cumulants of orders ≤ 5.
ER -