Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2506.13407 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- Two directed graphs are called covariance equivalent if they induce the same set of covariance matrices, up to a Lebesgue measure zero set, on the random variables of their associated linear structural equation models. For acyclic graphs, covariance equivalence is characterized both structurally, via essential graphs and characteristic imsets, and transformationally, through sequences of covered edge flips. However, when cycles are allowed, only a transformational characterization of covariance equivalence has been discovered. We consider a linear map whose fibers correspond to the sets of graphs with identical characteristic imset vectors, and study the toric ideal associated to its integer matrix. Using properties of this ideal we show that directed graphs with the same characteristic imset vectors are covariance equivalent. In applications, imsets form a smaller search space for solving causal discovery via greedy search.