# Gaps in Information Access in Social Networks

arXiv: https://arxiv.org/abs/1903.02047 · HTML: https://mlsanity.com/paper/1903.02047/

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Mar 2019.

## Built on by (most cited first, 9 of 9)

- [Fairness in Graph Mining: A Survey](https://mlsanity.com/paper/2204.09888/) (2022)
- [Fairness Amidst Non-IID Graph Data: A Literature Review](https://mlsanity.com/paper/2202.07170/) (2022)
- [Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link Prediction](https://mlsanity.com/paper/2309.17417/) (2023)
- [Structural Group Unfairness: Measurement and Mitigation by means of the Effective Resistance](https://mlsanity.com/paper/2305.03223/) (2023)
- [It's Not Fairness, and It's Not Fair: The Failure of Distributional Equality and the Promise of Relational Equality in Complete-Information Hiring Games](https://mlsanity.com/paper/2209.05602/) (2022)
- [CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphs](https://mlsanity.com/paper/2304.04391/) (2023)
- [DQ4FairIM: Fairness-aware Influence Maximization using Deep Reinforcement Learning](https://mlsanity.com/paper/2512.00545/) (2025)
- [Promoting Fairness in Information Access within Social Networks](https://mlsanity.com/paper/2512.14711/) (2025)
- [Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness](https://mlsanity.com/paper/2602.02512/) (2026)

## Abstract (arXiv)

The study of influence maximization in social networks has largely ignored disparate effects these algorithms might have on the individuals contained in the social network. Individuals may place a high value on receiving information, e.g. job openings or advertisements for loans. While well-connected individuals at the center of the network are likely to receive the information that is being distributed through the network, poorly connected individuals are systematically less likely to receive the information, producing a gap in access to the information between individuals. In this work, we study how best to spread information in a social network while minimizing this access gap. We propose to use the maximin social welfare function as an objective function, where we maximize the minimum probability of receiving the information under an intervention. We prove that in this setting this welfare function constrains the access gap whereas maximizing the expected number of nodes reached does not. We also investigate the difficulties of using the maximin, and present hardness results and analysis for standard greedy strategies. Finally, we investigate practical ways of optimizing for the maximin, and give empirical evidence that a simple greedy-based strategy works well in practice.