Cluster Algebras: Network Science and Machine Learning
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917595775500288 |
|---|---|
| author | Dechant, Pierre-Philippe He, Yang-Hui Heyes, Elli Hirst, Edward |
| author_facet | Dechant, Pierre-Philippe He, Yang-Hui Heyes, Elli Hirst, Edward |
| contents | Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network analysis methods are applied to the exchange graphs for cluster algebras of varying mutation types. The analysis indicates that when the graphs are represented without identifying by permutation equivalence between clusters an elegant symmetry emerges in the quiver exchange graph embedding. The ratio between number of seeds and number of quivers associated to this symmetry is computed for finite Dynkin type algebras up to rank 5, and conjectured for higher ranks. Simple machine learning techniques successfully learn to classify cluster algebras using the data of seeds. The learning performance exceeds 0.9 accuracies between algebras of the same mutation type and between types, as well as relative to artificially generated data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2203_13847 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Cluster Algebras: Network Science and Machine Learning Dechant, Pierre-Philippe He, Yang-Hui Heyes, Elli Hirst, Edward Combinatorics Machine Learning High Energy Physics - Theory Algebraic Geometry Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network analysis methods are applied to the exchange graphs for cluster algebras of varying mutation types. The analysis indicates that when the graphs are represented without identifying by permutation equivalence between clusters an elegant symmetry emerges in the quiver exchange graph embedding. The ratio between number of seeds and number of quivers associated to this symmetry is computed for finite Dynkin type algebras up to rank 5, and conjectured for higher ranks. Simple machine learning techniques successfully learn to classify cluster algebras using the data of seeds. The learning performance exceeds 0.9 accuracies between algebras of the same mutation type and between types, as well as relative to artificially generated data. |
| title | Cluster Algebras: Network Science and Machine Learning |
| topic | Combinatorics Machine Learning High Energy Physics - Theory Algebraic Geometry |
| url | https://arxiv.org/abs/2203.13847 |