FairGE: Fairness-Aware Graph Encoding in Incomplete Social Networks

• URL: http://arxiv.org/abs/2601.09394v2
• Date: Sun, 18 Jan 2026 10:11:42 GMT
• Title: FairGE: Fairness-Aware Graph Encoding in Incomplete Social Networks
• Abstract summary: FairGE (Fair Graph) is a fairness-aware framework for GTs in incomplete social networks.<n>It encodes fairness directly through spectral graph theory.<n>It achieves at least 16% improvement in both statistical parity and equality of opportunity compared with state-of-the-art baselines.
• Score: 21.123569802490724
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph Transformers (GTs) are increasingly applied to social network analysis, yet their deployment is often constrained by fairness concerns. This issue is particularly critical in incomplete social networks, where sensitive attributes are frequently missing due to privacy and ethical restrictions. Existing solutions commonly generate these incomplete attributes, which may introduce additional biases and further compromise user privacy. To address this challenge, FairGE (Fair Graph Encoding) is introduced as a fairness-aware framework for GTs in incomplete social networks. Instead of generating sensitive attributes, FairGE encodes fairness directly through spectral graph theory. By leveraging the principal eigenvector to represent structural information and padding incomplete sensitive attributes with zeros to maintain independence, FairGE ensures fairness without data reconstruction. Theoretical analysis demonstrates that the method suppresses the influence of non-principal spectral components, thereby enhancing fairness. Extensive experiments on seven real-world social network datasets confirm that FairGE achieves at least a 16% improvement in both statistical parity and equality of opportunity compared with state-of-the-art baselines. The source code is shown in https://github.com/LuoRenqiang/FairGE.

Related papers

• FairGC: Fairness-aware Graph Condensation [11.416044011065017]
  We introduce FairGC, a unified framework that embeds fairness directly into the graph distillation process.<n>We show that FairGC provides a superior balance between accuracy and fairness.<n>Our results confirm that FairGC significantly reduces disparity in Statistical Parity and Equal Opportunity.
  arXiv  Detail & Related papers  (2026-03-30T11:46:05Z)
• FairGU: Fairness-aware Graph Unlearning in Social Network [17.116462601803544]
  We introduce FairGU, a fairness-aware graph unlearning framework.<n>FairGU integrates a dedicated fairness-aware module with effective data protection strategies.<n>We demonstrate that FairGU consistently outperforms state-of-the-art graph unlearning methods.
  arXiv  Detail & Related papers  (2026-01-14T13:21:39Z)
• FairGSE: Fairness-Aware Graph Neural Network without High False Positive Rates [5.610647458198099]
  Graph neural networks (GNNs) have emerged as the mainstream paradigm for graph representation learning.<n>We propose Fair GNN via Structural Entropy (textbfFairGSE), a novel framework that maximizes two-dimensional structural entropy (2D-SE) to improve fairness without false positives.<n>Experiments on several real-world datasets show FairGSE reduces FPR by 39% vs. state-of-the-art fairness-aware GNNs, with comparable fairness improvement.
  arXiv  Detail & Related papers  (2025-11-15T09:40:47Z)
• Estimating Fair Graphs from Graph-Stationary Data [58.94389691379349]
  We consider group and individual fairness for graphs corresponding to group- and node-level definitions.<n>To evaluate the fairness of a given graph, we provide multiple bias metrics, including novel measurements in the spectral domain.<n>One variant of FairSpecTemp exploits commutativity properties of graph stationarity while directly constraining bias.<n>The other implicitly encourages fair estimates by restricting bias in the graph spectrum and is thus more flexible.
  arXiv  Detail & Related papers  (2025-10-08T20:51:57Z)
• Towards Fair Graph Neural Networks via Graph Counterfactual without Sensitive Attributes [4.980930265721185]
  We propose a framework named Fairwos (improving Fairness without sensitive attributes)<n>We first propose a mechanism to generate pseudo-sensitive attributes to remedy the problem of missing sensitive attributes.<n>We then design a strategy for finding graph counterfactuals from the real dataset.
  arXiv  Detail & Related papers  (2024-12-13T08:11:40Z)
• Enhancing Fairness in Unsupervised Graph Anomaly Detection through Disentanglement [33.565252991113766]
  Graph anomaly detection (GAD) is increasingly crucial in various applications, ranging from financial fraud detection to fake news detection.<n>Current GAD methods largely overlook the fairness problem, which might result in discriminatory decisions skewed toward certain demographic groups.<n>We devise a novel DisEntangle-based FairnEss-aware aNomaly Detection framework on the attributed graph, named DEFEND.<n>Our empirical evaluations on real-world datasets reveal that DEFEND performs effectively in GAD and significantly enhances fairness compared to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-06-03T04:48:45Z)
• FairGT: A Fairness-aware Graph Transformer [10.338939339111912]
  We propose FairGT, a Fairness-aware Graph Transformer crafted to mitigate fairness concerns inherent in GTs. FairGT incorporates a meticulous structural feature selection strategy and a multi-hop node feature integration method. Empirical evaluations conducted across five real-world datasets demonstrate FairGT's superiority in fairness metrics over existing graph transformers, graph neural networks, and state-of-the-art fairness-aware graph learning approaches.
  arXiv  Detail & Related papers  (2024-04-26T05:48:59Z)
• Endowing Pre-trained Graph Models with Provable Fairness [49.8431177748876]
  We propose a novel adapter-tuning framework that endows pre-trained graph models with provable fairness (called GraphPAR) Specifically, we design a sensitive semantic augmenter on node representations, to extend the node representations with different sensitive attribute semantics for each node. With GraphPAR, we quantify whether the fairness of each node is provable, i.e., predictions are always fair within a certain range of sensitive attribute semantics.
  arXiv  Detail & Related papers  (2024-02-19T14:16:08Z)
• Chasing Fairness in Graphs: A GNN Architecture Perspective [73.43111851492593]
  We propose textsfFair textsfMessage textsfPassing (FMP) designed within a unified optimization framework for graph neural networks (GNNs) In FMP, the aggregation is first adopted to utilize neighbors' information and then the bias mitigation step explicitly pushes demographic group node presentation centers together. Experiments on node classification tasks demonstrate that the proposed FMP outperforms several baselines in terms of fairness and accuracy on three real-world datasets.
  arXiv  Detail & Related papers  (2023-12-19T18:00:15Z)
• Marginal Nodes Matter: Towards Structure Fairness in Graphs [77.25149739933596]
  We propose textbfStructural textbfFair textbfGraph textbfNeural textbfNetwork (SFairGNN) to achieve structure fairness. Our experiments show SFairGNN can significantly improve structure fairness while maintaining overall performance in the downstream tasks.
  arXiv  Detail & Related papers  (2023-10-23T03:20:32Z)
• Fairness-Aware Graph Neural Networks: A Survey [53.41838868516936]
  Graph Neural Networks (GNNs) have become increasingly important due to their representational power and state-of-the-art predictive performance. GNNs suffer from fairness issues that arise as a result of the underlying graph data and the fundamental aggregation mechanism. In this article, we examine and categorize fairness techniques for improving the fairness of GNNs.
  arXiv  Detail & Related papers  (2023-07-08T08:09:06Z)
• Learning Fair Node Representations with Graph Counterfactual Fairness [56.32231787113689]
  We propose graph counterfactual fairness, which considers the biases led by the above facts. We generate counterfactuals corresponding to perturbations on each node's and their neighbors' sensitive attributes. Our framework outperforms the state-of-the-art baselines in graph counterfactual fairness.
  arXiv  Detail & Related papers  (2022-01-10T21:43:44Z)

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.