Multi-Hop Hybrid Graph Neural Network

Graph-structured data appear across diverse domains, such as social networks, citation graphs, biological systems, and knowledge bases. Graph Neural Networks (GNNs) have emerged as a powerful framework for learning on such data, yet existing architectures face significant challenges. Graph Convolutional Networks (GCNs) suffer from over-smoothing as depth increases, Graph Attention Networks (GATs) introduce computational and statistical instabilities, and naïve multi-hop propagation inflates memory and computation while failing to adapt to topology. These limitations motivate the development of a new framework that is both expressive and scalable. This dissertation proposes the Multi-Hop Hybrid Graph Neural Network (MHHGNN), a novel architecture that integrates three complementary components: (i) multihop propagation with adaptive, per-node attention, (ii) a GCN branch that provides stable structural smoothing, and (iii) a GAT branch that models semantic neighbor importance. The outputs of these branches are fused into unified node embeddings, which balance structural, semantic, and long-range contextual information. To prevent hop-collapse and enforce robustness, MHHGNN incorporates an entropy regularizer, Laplacian smoothness prior, and parameter norm constraints. Beyond supervised objectives, this work extends MHHGNN with a contrastive learning module that leverages graph augmentations to align embeddings across perturbed views. This hybrid objective combines classification, smoothness, entropy, and contrastive losses, and enables MHHGNN to effectively exploit both labeled and unlabeled data, improving generalization. Empirical results on benchmark citation datasets (Cora, Citeseer, and PubMed) demonstrate that MHHGNN outperforms state-of-the-art baselines in node classification accuracy while maintaining scalability. In summary, this dissertation advances graph representation learning by introducing a hybrid model that addresses over-smoothing, instability, and inefficiency in existing GNN designs. The proposed MHHGNN establishes a flexible and extensible foundation for future research in graph learning, with potential applications in domains such as biomedical networks, financial risk modeling, and recommendation systems.

Authors

Publication Details

Journal
scholarworks - UTEP (The University of Texas at El Paso)
Published
2025-12-01
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Hop Hybrid Graph Neural Network

James D. Arthur
scholarworks - UTEP (The University of Texas at El Paso)
Advanced Graph Neural Networks
article

Multi-Hop Hybrid Graph Neural Network

James D. Arthur
article en

Abstract

Graph-structured data appear across diverse domains, such as social networks, citation graphs, biological systems, and knowledge bases. Graph Neural Networks (GNNs) have emerged as a powerful framework for learning on such data, yet existing architectures face significant challenges. Graph Convolutional Networks (GCNs) suffer from over-smoothing as depth increases, Graph Attention Networks (GATs) introduce computational and statistical instabilities, and naïve multi-hop propagation inflates memory and computation while failing to adapt to topology. These limitations motivate the development of a new framework that is both expressive and scalable. This dissertation proposes the Multi-Hop Hybrid Graph Neural Network (MHHGNN), a novel architecture that integrates three complementary components: (i) multihop propagation with adaptive, per-node attention, (ii) a GCN branch that provides stable structural smoothing, and (iii) a GAT branch that models semantic neighbor importance. The outputs of these branches are fused into unified node embeddings, which balance structural, semantic, and long-range contextual information. To prevent hop-collapse and enforce robustness, MHHGNN incorporates an entropy regularizer, Laplacian smoothness prior, and parameter norm constraints. Beyond supervised objectives, this work extends MHHGNN with a contrastive learning module that leverages graph augmentations to align embeddings across perturbed views. This hybrid objective combines classification, smoothness, entropy, and contrastive losses, and enables MHHGNN to effectively exploit both labeled and unlabeled data, improving generalization. Empirical results on benchmark citation datasets (Cora, Citeseer, and PubMed) demonstrate that MHHGNN outperforms state-of-the-art baselines in node classification accuracy while maintaining scalability. In summary, this dissertation advances graph representation learning by introducing a hybrid model that addresses over-smoothing, instability, and inefficiency in existing GNN designs. The proposed MHHGNN establishes a flexible and extensible foundation for future research in graph learning, with potential applications in domains such as biomedical networks, financial risk modeling, and recommendation systems.

scholarworks - UTEP (The University of Texas at El Paso)
Openalex Percentile: Top 13%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.