IDEAS home Printed from https://ideas.repec.org/a/bjf/ijltem/v14y2025i13a951.html

Geometric Deep Learning: Understanding Graph Neural Networks through the Lens of Mathematics

Author

Listed:
  • Harshda C. Gore

    (Department of Mathematics, Dr. D. Y. Patil Arts, Commerce & Science College, Pimpri, Pune-18, Maharashtra, India)

  • Shailesh P. Dhome

    (Department of Mathematics, Dr. D. Y. Patil Arts, Commerce & Science College, Pimpri, Pune-18, Maharashtra, India)

Abstract

Geometric Deep Learning (GDL) extends traditional neural network paradigms to non-Euclidean data structures, enabling the effective processing of data that lies on manifolds or graphs. Among GDL techniques, Graph Neural Networks (GNNs) have emerged as powerful tools for modelling relational data by leveraging principles from graph theory and algebraic topology. This paper explores GNNs through the lens of mathematics, focusing on how geometric and topological insights drive the architecture and functionality of these networks. By framing GNNs in terms of graph signal processing and spectral theory, we illuminate how GNNs capture dependencies across nodes and edges, offering a structured approach to learning on graph-structured data. We further examine the theoretical underpinnings that make GNNs particularly suited for applications in social networks, molecular biology, and recommendation systems. In doing so, this study provides a mathematical perspective on the capabilities and limitations of GNNs, underscoring the role of invariance, equivariance, and generalization within graph-based learning models.

Suggested Citation

  • Harshda C. Gore & Shailesh P. Dhome, 2025. "Geometric Deep Learning: Understanding Graph Neural Networks through the Lens of Mathematics," International Journal of Latest Technology in Engineering, Management & Applied Science, RSIS International, vol. 14(13), pages 215-218, October.
  • Handle: RePEc:bjf:ijltem:v:14:y:2025:i:13:a:951
    DOI: 10.51583/IJLTEMAS.2025.1413SP043
    as

    Download full text from publisher

    File URL: https://www.ijltemas.in/submission/online/article/view/3226/3759
    Download Restriction: no

    File URL: https://www.ijltemas.in/submission/online/article/view/3226
    Download Restriction: no

    File URL: https://libkey.io/10.51583/IJLTEMAS.2025.1413SP043?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bjf:ijltem:v:14:y:2025:i:13:a:951. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Dr. Pawan Verma (email available below). General contact details of provider: https://www.ijltemas.in/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.