Identifiability in Graphical Discrete Lyapunov Models
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915761209999360 |
|---|---|
| author | Recke, Cecilie Olesen Lumpp, Sarah Kushnerchuk, Nataliia Oldekop, Janike Li, Jiayi Coons, Jane Ivy Robeva, Elina |
| author_facet | Recke, Cecilie Olesen Lumpp, Sarah Kushnerchuk, Nataliia Oldekop, Janike Li, Jiayi Coons, Jane Ivy Robeva, Elina |
| contents | In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the components of the random vector. This combinatorial framework naturally allows for cycles in the graph structure. We focus on the fundamental problem of identifying the entries of the parameter matrix. In contrast to the classical setting, we assume non-Gaussian error terms, which allows us to use the higher-order cumulants of the model. In this setup, we show generic identifiability for directed acyclic graphs with self-loops at each vertex and show how to express the parameters as a rational function of the cumulants. Furthermore, we establish local identifiability for all directed graphs containing self loops at each vertex and no isolated vertices. Finally, we provide first results on the defining equations of the models, showing model equivalence for certain graphs and paving the way towards structure learning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_21818 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Identifiability in Graphical Discrete Lyapunov Models Recke, Cecilie Olesen Lumpp, Sarah Kushnerchuk, Nataliia Oldekop, Janike Li, Jiayi Coons, Jane Ivy Robeva, Elina Statistics Theory 62R01, 62H22, 60G10, 62A09 In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the components of the random vector. This combinatorial framework naturally allows for cycles in the graph structure. We focus on the fundamental problem of identifying the entries of the parameter matrix. In contrast to the classical setting, we assume non-Gaussian error terms, which allows us to use the higher-order cumulants of the model. In this setup, we show generic identifiability for directed acyclic graphs with self-loops at each vertex and show how to express the parameters as a rational function of the cumulants. Furthermore, we establish local identifiability for all directed graphs containing self loops at each vertex and no isolated vertices. Finally, we provide first results on the defining equations of the models, showing model equivalence for certain graphs and paving the way towards structure learning. |
| title | Identifiability in Graphical Discrete Lyapunov Models |
| topic | Statistics Theory 62R01, 62H22, 60G10, 62A09 |
| url | https://arxiv.org/abs/2601.21818 |