Gaps in Information Access in Social Networks
Not on the map. Why?
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.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 3; 2024: 0; 2025: 2; 2026: 1.
9 papers.
- 2022Fairness in Graph Mining: A Surveycited by 76
- 2022Fairness Amidst Non-IID Graph Data: A Literature Reviewcited by 20
- 2023Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link Predictioncited by 8
- 2023Structural Group Unfairness: Measurement and Mitigation by means of the Effective Resistancecited by 4
- 2022It's Not Fairness, and It's Not Fair: The Failure of Distributional Equality and the Promise of Relational Equality in Complete-Information Hiring Gamescited by 3
- 2023CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphscited by 1
- 2025DQ4FairIM: Fairness-aware Influence Maximization using Deep Reinforcement Learningcited by 1
- 2025Promoting Fairness in Information Access within Social Networkscited by 1
- 2026Efficient Edge Rewiring Strategies for Enhancing PageRank Fairnesscited by 1
- 2026Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness23 Jan 2026
- 2025Promoting Fairness in Information Access within Social Networks8 Dec 2025
- 2025DQ4FairIM: Fairness-aware Influence Maximization using Deep Reinforcement Learning29 Nov 2025
- 2023Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link Prediction29 Sep 2023
- 2023Structural Group Unfairness: Measurement and Mitigation by means of the Effective Resistance5 May 2023
- 2023CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphs10 Apr 2023
- 2022It's Not Fairness, and It's Not Fair: The Failure of Distributional Equality and the Promise of Relational Equality in Complete-Information Hiring Games12 Sep 2022
- 2022Fairness in Graph Mining: A Survey21 Apr 2022
- 2022Fairness Amidst Non-IID Graph Data: A Literature Review15 Feb 2022