Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.09865 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916287174672384 |
|---|---|
| author | Devijver, Emilie Molinier, Rémi Gallopin, Mélina |
| author_facet | Devijver, Emilie Molinier, Rémi Gallopin, Mélina |
| contents | Stability, akin to reproducibility, is crucial in statistical analysis. This paper examines the stability of sparse network inference in high-dimensional graphical models, where selected edges should remain consistent across different samples. Our study focuses on the Graphical Lasso and its decomposition into two steps, with the first step involving hierarchical clustering using single linkage.We provide theoretical proof that single linkage is stable, evidenced by controlled distances between two dendrograms inferred from two samples. Practical experiments further illustrate the stability of the Graphical Lasso's various steps, including dendrograms, variable clusters, and final networks. Our results, validated through both theoretical analysis and practical experiments using simulated and real datasets, demonstrate that single linkage is more stable than other methods when a modular structure is present. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09865 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Stable network inference in high-dimensional graphical model using single-linkage Devijver, Emilie Molinier, Rémi Gallopin, Mélina Statistics Theory Stability, akin to reproducibility, is crucial in statistical analysis. This paper examines the stability of sparse network inference in high-dimensional graphical models, where selected edges should remain consistent across different samples. Our study focuses on the Graphical Lasso and its decomposition into two steps, with the first step involving hierarchical clustering using single linkage.We provide theoretical proof that single linkage is stable, evidenced by controlled distances between two dendrograms inferred from two samples. Practical experiments further illustrate the stability of the Graphical Lasso's various steps, including dendrograms, variable clusters, and final networks. Our results, validated through both theoretical analysis and practical experiments using simulated and real datasets, demonstrate that single linkage is more stable than other methods when a modular structure is present. |
| title | Stable network inference in high-dimensional graphical model using single-linkage |
| topic | Statistics Theory |
| url | https://arxiv.org/abs/2406.09865 |