Bridging Computational Social Science and Deep Learning: Cultural Dissemination-Inspired Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) have become vital in applications like document classification in citation networks, epidemic forecasting, viral marketing, user recommendation in social networks, and network monitoring. However, their deployment faces three key challenges: feature oversmoothing in deep architectures, poor handling of heterogeneous relationships, and monolithic feature aggregation. To address these, we introduce AxelGNN, a novel architecture based on Axelrod's cultural dissemination model that incorporates three key innovations: (1) similarity-gated interactions that adaptively promote convergence or divergence based on feature similarity, (2) segment-wise feature copying that enables fine-grained aggregation of semantic feature groups rather than monolithic vectors, and (3) global polarization that maintains multiple distinct representation clusters to prevent oversmoothing. This model demonstrates empirically the capability to handle both homophilic and heterophilic graphs within a single architecture, without requiring specialized model selection based on graph characteristics. Our experiments demonstrate that AxelGNN achieves competitive or superior performance compared to existing methods in node classification and influence estimation while maintaining computational efficiency.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 41 of its 70 references that are in the map. First posted on arXiv 23 Sep 2025.
Builds on
41 of 70 references.
References · 41
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2018Link Prediction Based on Graph Neural Networkscited by 829
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
29 more
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
- 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2020Learning to Drop: Robust Graph Neural Network via Topological Denoisingcited by 127
- 2020Towards Deeper Graph Neural Networks with Differentiable Group Normalizationcited by 113
- 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 96
- 2021Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patternscited by 95
- 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 88
- 2019Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAScited by 83
- 2023Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingcited by 67
- 2021A Comprehensive Survey on Community Detection with Deep Learningcited by 63
- 2020Gated Graph Recurrent Neural Networkscited by 57
- 2023Mitigating Over-Smoothing and Over-Squashing using Augmentations of Forman-Ricci Curvaturecited by 39
- 2021Block Modeling-Guided Graph Convolutional Neural Networkscited by 32
- 2024Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNscited by 31
- 2023PC-Conv: Unifying Homophily and Heterophily with Two-fold Filteringcited by 28
- 2023Deep Graph Representation Learning and Optimization for Influence Maximizationcited by 27
- 2022A Survey on Influence Maximization: From an ML-Based Combinatorial Optimizationcited by 15
- 2022ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splittingcited by 13
- 2021Maximizing Influence with Graph Neural Networkscited by 8
- 2025Depth-Adaptive Graph Neural Networks via Learnable Bakry-'Emery Curvaturecited by 8
- 2025UniGO: A Unified Graph Neural Network for Modeling Opinion Dynamics on Graphscited by 3
Built on by
Not cited yet.