Subgraph Filtering for Fair Graph Neural Networks (SF‑GNN) is a lightweight, architecture‑agnostic framework that reduces structural bias in GNNs by identifying and filtering bias‑prone edges during message passing. It combines sensitive homophily with structural propagation amplifiers such as hub participation and triadic closure to detect problematic edges, then applies stochastic edge filtering to downweight or remove them while preserving the rest of the graph. Experiments on five benchmark datasets demonstrate that SF‑GNN consistently improves fairness while maintaining competitive predictive performance, achieving a better fairness–accuracy trade‑off than recent fairness‑aware GNN baselines.
By Haohui Lu, jiyuan Tian, Fangyu Zhou, Shahadat Uddin
arXiv:2606. 17684v1 Announce Type: cross Abstract: Graph-based learning methods have become increasingly prominent due to their strong performance across diverse applications.
By Arturo P\'erez-Peralta, Sandra Ben\'itez-Pe\~na, Blas Kolic, Rosa E. Lillo
Graph neural networks (GNNs) can exhibit unfair behavior even when sensitive attributes are excluded from node features, because graph topology and message passing propagate group-correlated signals u...
arXiv:2602.08589v2 Announce Type: replace
Abstract: PageRank (PR) is a fundamental algorithm in graph machine learning tasks. Owing to the increasing importance of algorithmic fairness, we consider t...
By Emmanouil Kariotakis, Aritra Konar
arXiv:2608. 19381v1 Announce Type: cross Abstract: Network embedding methods learn low-dimensional representations of graph-structured data to support downstream tasks such as node classification, link prediction, and influence maximization.
By Ella Has, Harshith Kumar Yadav, Gaurav Dixit, Mykola Pechenizkiy, Akrati Saxena
arXiv:2508. 12042v3 Announce Type: replace Abstract: Federated learning (FL) allows collaborative training of machine learning models across multiple parties without sharing raw data.
By Zahra Kharaghani, Ali Dadras, Tommy L\"ofstedt