Graph Laplacians, Riemannian Manifolds and their Machine-Learning
arXiv:2006.16619
Abstract
Graph Laplacians as well as related spectral inequalities and (co-)homology provide a foray into discrete analogues of Riemannian manifolds, providing a rich interplay between combinatorics, geometry and theoretical physics. We apply some of the latest techniques in data science such as supervised and unsupervised machine-learning and topological data analysis to the Wolfram database of some 8000 finite graphs in light of studying these correspondences. Encouragingly, we find that neural classifiers, regressors and networks can perform, with high efficiently and accuracy, a multitude of tasks ranging from recognizing graph Ricci-flatness, to predicting the spectral gap, to detecting the presence of Hamiltonian cycles, etc.
arXiv comment47+1 pages, 30 figures
References in corpus (28)
- A roadmap for the computation of persistent homology
- Discovering physical concepts with neural networks
- Discovering Symbolic Models from Deep Learning with Inductive Biases
- Machine Learning of Calabi-Yau Volumes
- Deep Learning and AdS/CFT
- Machine Learning CICY Threefolds
- Branes with Brains: Exploring String Vacua with Deep Reinforcement Learning
- Machine Learning Line Bundle Cohomologies of Hypersurfaces in Toric Varieties
- Deep Learning the Hyperbolic Volume of a Knot
- Deep learning in the heterotic orbifold landscape
- Deep Learning for Symbolic Mathematics
- Quiver Mutations, Seiberg Duality and Machine Learning
- The Calabi-Yau Landscape: from Geometry, to Physics, to Machine-Learning
- Classifying Calabi-Yau threefolds using infinite distance limits
- Homologies of path complexes and digraphs
- Distinguishing Elliptic Fibrations with AI
- Estimating Calabi-Yau Hypersurface and Triangulation Counts with Equation Learners
- Deep learning and k-means clustering in heterotic string vacua with line bundles
- Machine Learning meets Number Theory: The Data Science of Birch-Swinnerton-Dyer
- Lectures on the Calabi-Yau Landscape
- Machine Learning Etudes in Conformal Field Theories
- Graphs with large girth and nonnegative curvature dimension condition
- A brief review on geometry and spectrum of graphs
- Li-Yau inequality for unbounded Laplacian on graphs
- Ricci-flat graphs with girth at least five
- Ricci-flat cubic graphs with girth five
- Ricci-flat graphs with maximum degree at most 4
- Geometric and spectral properties of directed graphs under a lower Ricci curvature bound
Cited by in corpus (7)
- The Calabi-Yau Landscape: from Geometry, to Physics, to Machine-Learning
- Machine Learning Lie Structures & Applications to Physics
- Hilbert Series, Machine Learning, and Applications to Physics
- The mass of simple and higher-order networks
- Higher-order Connection Laplacians for Directed Simplicial Complexes
- Universes as Big Data
- Kähler Geometry of Quiver Varieties and Machine Learning