Structural Group Unfairness: Measurement and Mitigation by means of the Effective Resistance
Not on the map. Why?
Abstract (arXiv)
Social networks contribute to the distribution of social capital, defined as the relationships, norms of trust and reciprocity within a community or society that facilitate cooperation and collective action. Therefore, better positioned members in a social network benefit from faster access to diverse information and higher influence on information dissemination. A variety of methods have been proposed in the literature to measure social capital at an individual level. However, there is a lack of methods to quantify social capital at a group level, which is particularly important when the groups are defined on the grounds of protected attributes. To fill this gap, we propose to measure the social capital of a group of nodes by means of the effective resistance and emphasize the importance of considering the entire network topology. Grounded in spectral graph theory, we introduce three effective resistance-based measures of group social capital, namely group isolation, group diameter and group control, where the groups are defined according to the value of a protected attribute. We denote the social capital disparity among different groups in a network as structural group unfairness, and propose to mitigate it by means of a budgeted edge augmentation heuristic that systematically increases the social capital of the most disadvantaged group. In experiments on real-world networks, we uncover significant levels of structural group unfairness when using gender as the protected attribute, with females being the most disadvantaged group in comparison to males. We also illustrate how our proposed edge augmentation approach is able to not only effectively mitigate the structural group unfairness but also increase the social capital of all groups in the network.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 13 of its 92 references that are in the map. First posted on arXiv 5 May 2023.
Builds on
13 of 92 references.
References · 13
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2016Variational Graph Auto-Encoderscited by 1,382
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 494
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 97
- 2022Oversquashing in GNNs through the lens of information contraction and graph expansioncited by 53
- 2018Political Discourse on Social Media: Echo Chambers, Gatekeepers, and the Price of Bipartisanshipcited by 34
- 2016Echo Chambers: Emotional Contagion and Group Polarization on Facebookcited by 27
- 2023Bridging Systems: Open Problems for Countering Destructive Divisiveness across Ranking, Recommenders, and Governancecited by 17
- 2019Gaps in Information Access in Social Networkscited by 9
1 more
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Oversmoothing, Oversquashing, Heterophily, Long-Range, and more: Demystifying Common Beliefs in Graph Machine Learningcited by 19
- 2026Structural Bias Beyond Homophily: A Study of Fairness in Link Predictioncited by 2
- 2025Estimating Fair Graphs from Graph-Stationary Datacited by 0
- 2026k-hop Fairness: Addressing Disparities in Graph Link Prediction Beyond First-Order Neighborhoodscited by 0
- 2026k-hop Fairness: Addressing Disparities in Graph Link Prediction Beyond First-Order Neighborhoods4 Mar 2026
- 2026Structural Bias Beyond Homophily: A Study of Fairness in Link Prediction12 Feb 2026
- 2025Estimating Fair Graphs from Graph-Stationary Data8 Oct 2025
- 2025Oversmoothing, Oversquashing, Heterophily, Long-Range, and more: Demystifying Common Beliefs in Graph Machine Learning21 May 2025