Overlapping Community Detection in Graphs using a Deep Dynamic Residual Graph Convolutional Network
A deep dynamic residual graph convolutional network (DynaResGCN) model is designed to effectively detect overlapping communities in graphs by incorporating residual connections, dynamic dilated aggregation, and an encoder-decoder framework.
Robust Link Prediction via Information Bottleneck-based Data Augmentation
CORE, a novel data augmentation framework, leverages the Information Bottleneck principle to eliminate noisy and spurious edges while recovering missing edges in graphs, thereby enhancing the generalizability of link prediction models.
Universal Graph Prompt Tuning: A Versatile Approach for Adapting Pre-trained Graph Neural Networks
A universal prompt-based tuning method called Graph Prompt Feature (GPF) that can be applied to pre-trained GNN models under any pre-training strategy, achieving equivalent performance to specialized prompting functions.
Enhancing Graph Transformers with Spectral Information: The Graph Spectral Token
The Graph Spectral Token is a novel approach to directly encode graph spectral information into the transformer architecture, capturing the global structure of the graph and enhancing the expressive power of graph transformers.
Spectral Graph Pruning: A Novel Approach to Mitigate Over-Squashing and Over-Smoothing in Graph Neural Networks
Deleting edges can simultaneously address the problems of over-squashing and over-smoothing in graph neural networks by optimizing the spectral gap of the graph.
Generalization Bounds for Message Passing Neural Networks on Sparse Noisy Graphs Sampled from a Mixture of Graphons
Message passing neural networks (MPNNs) can generalize effectively to unseen sparse, noisy graphs sampled from a mixture of graphons, as long as the graphs are sufficiently large.
Bounds on the Vapnik-Chervonenkis Dimension of Graph Neural Networks with Pfaffian Activation Functions
The VC dimension of graph neural networks with Pfaffian activation functions, such as tanh, sigmoid, and arctangent, is bounded with respect to the network hyperparameters (number of parameters, layers, nodes, feature dimension) as well as the number of colors resulting from the 1-WL test on the graph domain.
GIDN: A Lightweight Graph Inception Diffusion Network for Efficient Link Prediction
A lightweight Graph Inception Diffusion Network (GIDN) model that generalizes graph diffusion in different feature spaces and uses the inception module to avoid the large computational cost of complex network structures, achieving high-efficiency link prediction.
Continuous Spiking Graph Neural Networks for Efficient and Effective Graph Learning
The proposed Continuous Spiking Graph Neural Networks (COS-GNN) framework integrates spiking neural networks (SNNs) and continuous graph neural networks (CGNNs) to achieve energy-efficient and effective graph learning, while addressing the information loss issue in SNNs through high-order spike representation.
Mitigating Redundancy in Graph Neural Networks for Improved Expressivity and Accuracy
Redundancy in the information flow and computation of graph neural networks can lead to oversquashing, limiting their expressivity and accuracy. The proposed DAG-MLP approach systematically eliminates redundant information by using neighborhood trees and exploits computational redundancy through merging of isomorphic subtrees, achieving higher expressivity and accuracy compared to standard graph neural networks.