Linear relations of colored Gaussian cycles
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909667378069504 |
|---|---|
| author | Göbel, Hannah Misra, Pratik |
| author_facet | Göbel, Hannah Misra, Pratik |
| contents | A colored Gaussian graphical model is a linear concentration model in which equalities among the concentrations are specified by a coloring of an underlying graph. Marigliano and Davies conjectured that every linear binomial that appears in the vanishing ideal of an undirected colored cycle corresponds to a graph symmetry. We prove this conjecture for 3,5, and 7 cycles and disprove it for colored cycles of any other length. We construct the counterexamples by proving the fact that the determinant of the concentration matrices of two colored paths can be equal even when they are not identical or reflection of each other. We also explore the potential strengthening of the conjecture and prove a revised version of the conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_23936 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Linear relations of colored Gaussian cycles Göbel, Hannah Misra, Pratik Combinatorics Algebraic Geometry Statistics Theory 62R01 A colored Gaussian graphical model is a linear concentration model in which equalities among the concentrations are specified by a coloring of an underlying graph. Marigliano and Davies conjectured that every linear binomial that appears in the vanishing ideal of an undirected colored cycle corresponds to a graph symmetry. We prove this conjecture for 3,5, and 7 cycles and disprove it for colored cycles of any other length. We construct the counterexamples by proving the fact that the determinant of the concentration matrices of two colored paths can be equal even when they are not identical or reflection of each other. We also explore the potential strengthening of the conjecture and prove a revised version of the conjecture. |
| title | Linear relations of colored Gaussian cycles |
| topic | Combinatorics Algebraic Geometry Statistics Theory 62R01 |
| url | https://arxiv.org/abs/2506.23936 |