Detecting bias in algorithms used to disseminate information in social networks and mitigating it using multiobjective optimization

Social connections are conduits through which individuals communicate, information propagates, and diseases spread. Identifying individuals who are more likely to adopt ideas and spread them is essential in order to develop effective information campaigns, maximize the reach of resources, and fight epidemics. Consequently, a lot of work has focused on identifying influencers in social networks with various influence maximization algorithms being proposed. Based on extensive computer simulations on synthetic and 10 diverse real-world social networks we show that seeding information in social networks using state-of-the-art influence maximization methods creates information gaps. Our results show that these algorithms select influencers who do not disseminate information equitably, threatening to create an increasingly unequal society. To overcome this issue, we devise a multiobjective algorithm which both maximizes influence and information equity. Our results demonstrate it is possible to reduce vulnerability at a relatively low trade-off with respect to spread. This highlights that in our search for maximizing the spread of information we do not need to compromise on information equality.

Authors

Institutions

Publication Details

Journal
PNAS Nexus
Published
2025-09-30
DOI
https://doi.org/10.1093/pnasnexus/pgaf291
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Detecting bias in algorithms used to disseminate information in social networks and mitigating it using multiobjective optimization

Manuel Cebrián, Manuel García–Herranz, Vedran Sekara, Iván Dotú et al.
PNAS Nexus
Complex Network Analysis Techniques
article

Detecting bias in algorithms used to disseminate information in social networks and mitigating it using multiobjective optimization

Manuel Cebrián, Manuel García–Herranz, Vedran Sekara, Iván Dotú, Esteban Moro
article en

Abstract

Social connections are conduits through which individuals communicate, information propagates, and diseases spread. Identifying individuals who are more likely to adopt ideas and spread them is essential in order to develop effective information campaigns, maximize the reach of resources, and fight epidemics. Consequently, a lot of work has focused on identifying influencers in social networks with various influence maximization algorithms being proposed. Based on extensive computer simulations on synthetic and 10 diverse real-world social networks we show that seeding information in social networks using state-of-the-art influence maximization methods creates information gaps. Our results show that these algorithms select influencers who do not disseminate information equitably, threatening to create an increasingly unequal society. To overcome this issue, we devise a multiobjective algorithm which both maximizes influence and information equity. Our results demonstrate it is possible to reduce vulnerability at a relatively low trade-off with respect to spread. This highlights that in our search for maximizing the spread of information we do not need to compromise on information equality.

PNAS NexusVol. 4(10)
United Nations Children's Fund (US), Northeastern University (US), Pioneer (United States) (US), United Nations University Institute on Globalization, Culture and Mobility (ES), Centre for Automation and Robotics (ES), United Nations Children's Fund India (IN), IT University of Copenhagen (DK)
Openalex Percentile: Top 76%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.