Corpus ID: 220265800

Graph Laplacians, Riemannian Manifolds and their Machine-Learning

  title={Graph Laplacians, Riemannian Manifolds and their Machine-Learning},
  author={Yanghui He and Shing-Tung Yau},
  journal={arXiv: Combinatorics},
  • Yanghui He, Shing-Tung Yau
  • Published 2020
  • Mathematics, Physics
  • arXiv: Combinatorics
  • 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… CONTINUE READING
    8 Citations

    Figures and Tables from this paper

    Machine-Learning Mathematical Structures
    • 1
    • PDF
    Universes as Big Data.
    • 1
    • PDF
    Machine Learning Lie Structures & Applications to Physics
    • 1
    • PDF
    Machine-Learning the Sato--Tate Conjecture
    • 4
    • PDF
    Machine-Learning Number Fields
    • 1
    • PDF
    Eigenvalues and eigenforms on Calabi-Yau threefolds
    • 3
    • PDF
    K\"ahler Geometry of Quiver Varieties and Machine Learning
    • PDF