Graph Neural Networks Applications Across Domains: All Insights You Need

• URL: http://arxiv.org/abs/2606.27202v1
• Date: Thu, 25 Jun 2026 16:00:11 GMT
• Title: Graph Neural Networks Applications Across Domains: All Insights You Need
• Abstract summary: Graph neural networks have moved from a niche representation-learning technique to the default model class wherever data carry relational structure.<n>This survey organises the field around a single design space, derives the spectral and spatial formulations from shared first principles.<n>We examine twelve application domains, among them recommendation and social networks, knowledge graphs and language-model integration, drug discovery and molecular property learning, healthcare and neuroscience, computer vision, traffic and urban computing, power and renewable-energy systems, wireless and sixth-generation networks, fraud and cybersecurity, industrial prognostics, materials science, and climate modelling.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph neural networks have moved from a niche representation-learning technique to the default model class wherever data carry relational structure. The interesting question is no longer whether message passing helps on a given dataset, but where graph structure earns its computational cost and where it does not. This survey organises the field around a single design space, derives the spectral and spatial formulations from shared first principles, and connects expressive power to the Weisfeiler-Leman hierarchy with explicit statements of what current architectures can and cannot separate. Against that methodological backbone we examine twelve application domains, among them recommendation and social networks, knowledge graphs and language-model integration, drug discovery and molecular property learning, healthcare and neuroscience, computer vision, traffic and urban computing, power and renewable-energy systems, wireless and sixth-generation networks, fraud and cybersecurity, industrial prognostics, materials science, and climate modelling. For each domain we specify the graph-construction choices and their costs, identify which architecture families dominate and why, and separate reported gains from artefacts of weak baselines or favourable splits. A cross-domain comparison exposes recurring patterns: heterophily and scale undercut the same models almost everywhere, temporal graphs remain harder than their static counterparts, and the architectures that top public leaderboards are seldom the ones that reach deployment. We treat over-smoothing, over-squashing, robustness, distribution shift, fairness, and explainability not as a closing checklist but as the constraints that decide adoption.

Related papers

• Unifying Graph Neural Networks Through a Common Layer Equation [75.88127999406392]
  We introduce a common layer equation that represents covered architectures through seven components.<n>The central factorization separates where information moves, encoded by the propagation bank, from what moves, encoded by the message maps.<n>We make this unification explicit and checkable through worked reductions of canonical layers and component assignments.
  arXiv  Detail & Related papers  (2026-08-17T04:37:59Z)
• Toward a universal foundation model for graph-structured data [10.419880239076734]
  Graphs are a central representation in biomedical research, capturing molecular interaction networks, gene regulatory circuits, cell--cell communication maps, and knowledge graphs.<n>Existing graph neural networks are typically trained on a single dataset and learn representations specific only to that graph's node features, topology, and label space.<n>Here we introduce a graph foundation model designed to learn transferable structural representations that are not specific to specific node identities or feature schemes.
  arXiv  Detail & Related papers  (2026-04-07T19:21:21Z)
• Graph Foundation Models: A Comprehensive Survey [66.74249119139661]
  Graph Foundation Models (GFMs) aim to bring scalable, general-purpose intelligence to structured data.<n>This survey provides a comprehensive overview of GFMs, unifying diverse efforts under a modular framework.<n>GFMs are poised to become foundational infrastructure for open-ended reasoning over structured data.
  arXiv  Detail & Related papers  (2025-05-21T05:08:00Z)
• In-situ graph reasoning and knowledge expansion using Graph-PReFLexOR [0.0]
  We present Graph-PReFLexOR, a framework that combines graph reasoning with symbolic abstraction to dynamically expand domain knowledge.<n>Inspired by reinforcement learning, it defines reasoning as a structured mapping, where tasks yield knowledge graphs, abstract patterns, and ultimately, final answers.<n>Results show superior reasoning depth and adaptability, underscoring the potential for transparent, multidisciplinary AI-driven discovery.
  arXiv  Detail & Related papers  (2025-01-14T13:52:41Z)
• Towards Graph Prompt Learning: A Survey and Beyond [38.55555996765227]
  Large-scale "pre-train and prompt learning" paradigms have demonstrated remarkable adaptability. This survey categorizes over 100 relevant works in this field, summarizing general design principles and the latest applications.
  arXiv  Detail & Related papers  (2024-08-26T06:36:42Z)
• Federated Graph Semantic and Structural Learning [54.97668931176513]
  This paper reveals that local client distortion is brought by both node-level semantics and graph-level structure. We postulate that a well-structural graph neural network possesses similarity for neighbors due to the inherent adjacency relationships. We transform the adjacency relationships into the similarity distribution and leverage the global model to distill the relation knowledge into the local model.
  arXiv  Detail & Related papers  (2024-06-27T07:08:28Z)
• On Discprecncies between Perturbation Evaluations of Graph Neural Network Attributions [49.8110352174327]
  We assess attribution methods from a perspective not previously explored in the graph domain: retraining. The core idea is to retrain the network on important (or not important) relationships as identified by the attributions. We run our analysis on four state-of-the-art GNN attribution methods and five synthetic and real-world graph classification datasets.
  arXiv  Detail & Related papers  (2024-01-01T02:03:35Z)
• Everything is Connected: Graph Neural Networks [0.0]
  This short survey aims to enable the reader to assimilate the key concepts in the area of graph representation learning. The main aim of this short survey is to enable the reader to assimilate the key concepts in the area, and position graph representation learning in a proper context with related fields.
  arXiv  Detail & Related papers  (2023-01-19T18:09:43Z)
• House-GAN: Relational Generative Adversarial Networks for Graph-constrained House Layout Generation [59.86153321871127]
  The main idea is to encode the constraint into the graph structure of its relational networks. We have demonstrated the proposed architecture for a new house layout generation problem.
  arXiv  Detail & Related papers  (2020-03-16T03:16:12Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.