Cluster Algebras: Network Science and Machine Learning
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding
Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
AdvSGM: Differentially Private Graph Learning via Adversarial Skip-gram Model
Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.