Bluesky: Network topology, polarization, and algorithmic curation.
Quelle, D.; and Bovet, A.
PLOS ONE, 20(2): e0318034. February 2025.
Paper
doi
link
bibtex
abstract
@article{quelleBlueskyNetworkTopology2025,
title = {Bluesky: {Network} topology, polarization, and algorithmic curation},
volume = {20},
copyright = {Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License},
issn = {1932-6203},
shorttitle = {Bluesky},
url = {https://dx.plos.org/10.1371/journal.pone.0318034},
doi = {10.1371/journal.pone.0318034},
abstract = {Bluesky is a nascent “Twitter-like” and decentralized social media network with novel features and unprecedented data access. This paper provides a characterization of its interaction network, studying the political leaning, polarization, network structure, and algorithmic curation mechanisms of five million users. The dataset spans from the website’s first release in February of 2023 to May of 2024. We investigate the replies, likes, reposts, and follows layers of the Bluesky network. We find that all networks are characterized by heavy-tailed distributions, high clustering, and short connection paths, similar to other larger social networks. BlueSky introduced feeds—algorithmic content recommenders created for and by users. We analyze all feeds and find that while a large number of custom feeds have been created, users’ uptake of them appears to be limited. We analyze the hyperlinks shared by BlueSky’s users and find no evidence of polarization in terms of the political leaning of the news sources they share. They share predominantly leftcenter news sources and little to no links associated with questionable news sources. In contrast to the homogeneous political ideology, we find significant issues-based divergence by studying opinions related to the Israel-Palestine conflict. Two clear homophilic clusters emerge: Pro-Palestinian voices outnumber pro-Israeli users, and the proportion has increased. We conclude by claiming that Bluesky—for all its novel features—is very similar in its network structure to existing and larger social media sites and provides unprecedented research opportunities for social scientists, network scientists, and political scientists alike.},
language = {en},
number = {2},
urldate = {2025-02-27},
journal = {PLOS ONE},
author = {Quelle, Dorian and Bovet, Alexandre},
editor = {Pierri, Francesco},
month = feb,
year = {2025},
keywords = {computational social science, network science, polarization, social media},
pages = {e0318034},
}
Bluesky is a nascent “Twitter-like” and decentralized social media network with novel features and unprecedented data access. This paper provides a characterization of its interaction network, studying the political leaning, polarization, network structure, and algorithmic curation mechanisms of five million users. The dataset spans from the website’s first release in February of 2023 to May of 2024. We investigate the replies, likes, reposts, and follows layers of the Bluesky network. We find that all networks are characterized by heavy-tailed distributions, high clustering, and short connection paths, similar to other larger social networks. BlueSky introduced feeds—algorithmic content recommenders created for and by users. We analyze all feeds and find that while a large number of custom feeds have been created, users’ uptake of them appears to be limited. We analyze the hyperlinks shared by BlueSky’s users and find no evidence of polarization in terms of the political leaning of the news sources they share. They share predominantly leftcenter news sources and little to no links associated with questionable news sources. In contrast to the homogeneous political ideology, we find significant issues-based divergence by studying opinions related to the Israel-Palestine conflict. Two clear homophilic clusters emerge: Pro-Palestinian voices outnumber pro-Israeli users, and the proportion has increased. We conclude by claiming that Bluesky—for all its novel features—is very similar in its network structure to existing and larger social media sites and provides unprecedented research opportunities for social scientists, network scientists, and political scientists alike.
Politics and polarization on Bluesky.
Salloum, A.; Quelle, D.; Iannucci, L.; Bovet, A.; and Kivelä, M.
June 2025.
arXiv:2506.03443 [cs]
Paper
doi
link
bibtex
abstract
@misc{salloumPoliticsPolarizationBluesky2025,
title = {Politics and polarization on {Bluesky}},
url = {http://arxiv.org/abs/2506.03443},
doi = {10.48550/arXiv.2506.03443},
abstract = {Online political discourse is increasingly shaped not by a few dominant platforms but by a fragmented ecosystem of social media spaces, each with its own user base, target audience, and algorithmic mediation of discussion. Such fragmentation may fundamentally change how polarization manifests online. In this study, we investigate the characteristics of political discourse and polarization on the emerging social media site Bluesky. We collect all activity on the platform between December 2024 and May 2025 to map out the platform's political topic landscape and detect distinct polarization patterns. Our comprehensive data collection allows us to employ a data-driven methodology for identifying political themes, classifying user stances, and measuring both structural and content-based polarization across key topics raised in English-language discussions. Our analysis reveals that approximately 13\% of Bluesky posts engage with political content, with prominent topics including international conflicts, U.S. politics, and socio-technological debates. We find high levels of structural polarization across several salient political topics. However, the most polarized topics are also highly imbalanced in the numbers of users on opposing sides, with the smaller group consisting of only 1-2\% of the users. While discussions in Bluesky echo familiar political narratives and polarization trends, the platform exhibits a more politically homogeneous user base than was typical prior to the current wave of platform fragmentation.},
urldate = {2026-02-25},
publisher = {arXiv},
author = {Salloum, Ali and Quelle, Dorian and Iannucci, Letizia and Bovet, Alexandre and Kivelä, Mikko},
month = jun,
year = {2025},
note = {arXiv:2506.03443 [cs]},
keywords = {computational social science, network science, polarization, social media},
}
Online political discourse is increasingly shaped not by a few dominant platforms but by a fragmented ecosystem of social media spaces, each with its own user base, target audience, and algorithmic mediation of discussion. Such fragmentation may fundamentally change how polarization manifests online. In this study, we investigate the characteristics of political discourse and polarization on the emerging social media site Bluesky. We collect all activity on the platform between December 2024 and May 2025 to map out the platform's political topic landscape and detect distinct polarization patterns. Our comprehensive data collection allows us to employ a data-driven methodology for identifying political themes, classifying user stances, and measuring both structural and content-based polarization across key topics raised in English-language discussions. Our analysis reveals that approximately 13% of Bluesky posts engage with political content, with prominent topics including international conflicts, U.S. politics, and socio-technological debates. We find high levels of structural polarization across several salient political topics. However, the most polarized topics are also highly imbalanced in the numbers of users on opposing sides, with the smaller group consisting of only 1-2% of the users. While discussions in Bluesky echo familiar political narratives and polarization trends, the platform exhibits a more politically homogeneous user base than was typical prior to the current wave of platform fragmentation.
A multilevel network approach to revealing patterns of online political selective exposure.
Zhang, Y.; Castro, L.; Esser, F.; and Bovet, A.
PLOS One, 20(9): e0332663. September 2025.
Paper
doi
link
bibtex
abstract
@article{zhangMultilevelNetworkApproach2025,
title = {A multilevel network approach to revealing patterns of online political selective exposure},
volume = {20},
copyright = {Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License},
issn = {1932-6203},
url = {https://dx.plos.org/10.1371/journal.pone.0332663},
doi = {10.1371/journal.pone.0332663},
abstract = {Selective exposure, individuals’ inclination to seek out information that supports their beliefs while avoiding information that contradicts them, plays an important role in the emergence of polarization and echo chambers. In the political domain, selective exposure is usually measured on a left-right ideology scale, ignoring finer details. To bridge the gap, this work introduces a multilevel analysis framework based on a multi-scale community detection approach. To test this approach, we combine survey and Twitter/X data collected during the 2022 Brazilian Presidential Election and investigate selective exposure patterns among survey respondents in their choices of whom to follow. We construct a bipartite network connecting survey respondents with political influencers and project it onto the influencer nodes. Applying multi-scale community detection to this projection uncovers a hierarchical clustering of political influencers, where each cluster is more frequently co-followed by a specific subgroup of survey respondents compared to others. Different indices of selective exposure, such as Community Overlap, Identity Diversity, Information Diversity, Structural Integration, and Connectivity Inequality, suggest that the characteristics of the influencer communities engaged by survey respondents vary with the level of community resolution. This finding indicates that online political selective exposure exhibits a more complex structure than a mere left-right dichotomy. Moreover, depending on the resolution level we consider, we find different associations between network indices of exposure patterns and 189 individual attributes of the survey respondents. For example, at finer levels, survey respondents’ Community Overlap is associated with several factors, such as ideological position, demographics, news consumption frequency, and incivility perception. In comparison, only their ideological position is a significant factor at coarser levels. Our work demonstrates that measuring selective exposure at a single level, such as left and right, misses important information necessary to capture this phenomenon correctly.},
language = {en},
number = {9},
urldate = {2025-09-23},
journal = {PLOS One},
author = {Zhang, Yuan and Castro, Laia and Esser, Frank and Bovet, Alexandre},
editor = {Rivas-de-Roca, Rubén},
month = sep,
year = {2025},
keywords = {computational social science, network science, polarization, social media},
pages = {e0332663},
}
Selective exposure, individuals’ inclination to seek out information that supports their beliefs while avoiding information that contradicts them, plays an important role in the emergence of polarization and echo chambers. In the political domain, selective exposure is usually measured on a left-right ideology scale, ignoring finer details. To bridge the gap, this work introduces a multilevel analysis framework based on a multi-scale community detection approach. To test this approach, we combine survey and Twitter/X data collected during the 2022 Brazilian Presidential Election and investigate selective exposure patterns among survey respondents in their choices of whom to follow. We construct a bipartite network connecting survey respondents with political influencers and project it onto the influencer nodes. Applying multi-scale community detection to this projection uncovers a hierarchical clustering of political influencers, where each cluster is more frequently co-followed by a specific subgroup of survey respondents compared to others. Different indices of selective exposure, such as Community Overlap, Identity Diversity, Information Diversity, Structural Integration, and Connectivity Inequality, suggest that the characteristics of the influencer communities engaged by survey respondents vary with the level of community resolution. This finding indicates that online political selective exposure exhibits a more complex structure than a mere left-right dichotomy. Moreover, depending on the resolution level we consider, we find different associations between network indices of exposure patterns and 189 individual attributes of the survey respondents. For example, at finer levels, survey respondents’ Community Overlap is associated with several factors, such as ideological position, demographics, news consumption frequency, and incivility perception. In comparison, only their ideological position is a significant factor at coarser levels. Our work demonstrates that measuring selective exposure at a single level, such as left and right, misses important information necessary to capture this phenomenon correctly.
Effective Yet Ephemeral Propaganda Defense: There Needs to Be More than One-Shot Inoculation to Enhance Critical Thinking.
Hoferer, N.; Sprenkamp, K.; Quelle, D. C.; Jones, D. G.; Katashinskaya, Z.; Bovet, A.; and Zavolokina, L.
In
Proceedings of the Extended Abstracts of the CHI Conference on Human Factors in Computing Systems, pages 1–13, Yokohama Japan, April 2025. ACM
Citations: 1 (Crossref) [2026-03-06] Citations: 2 (SemanticScholar) [2026-03-06]
Paper
doi
link
bibtex
@inproceedings{hofererEffectiveEphemeralPropaganda2025,
address = {Yokohama Japan},
title = {Effective {Yet} {Ephemeral} {Propaganda} {Defense}: {There} {Needs} to {Be} {More} than {One}-{Shot} {Inoculation} to {Enhance} {Critical} {Thinking}},
copyright = {All rights reserved},
isbn = {979-8-4007-1395-8},
shorttitle = {Effective {Yet} {Ephemeral} {Propaganda} {Defense}},
url = {https://dl.acm.org/doi/10.1145/3706599.3720125},
doi = {10.1145/3706599.3720125},
language = {en},
urldate = {2025-08-28},
booktitle = {Proceedings of the {Extended} {Abstracts} of the {CHI} {Conference} on {Human} {Factors} in {Computing} {Systems}},
publisher = {ACM},
author = {Hoferer, Nicolas and Sprenkamp, Kilian and Quelle, Dorian Christoph and Jones, Daniel Gordon and Katashinskaya, Zoya and Bovet, Alexandre and Zavolokina, Liudmila},
month = apr,
year = {2025},
note = {Citations: 1 (Crossref) [2026-03-06]
Citations: 2 (SemanticScholar) [2026-03-06]},
keywords = {computational social science, disinformation},
pages = {1--13},
}
Evolution of Conditional Entropy for Diffusion Dynamics on Graphs.
Koovely, S.; and Bovet, A.
October 2025.
arXiv:2510.19441 [math]
Paper
doi
link
bibtex
abstract
@misc{koovelyEvolutionConditionalEntropy2025,
title = {Evolution of {Conditional} {Entropy} for {Diffusion} {Dynamics} on {Graphs}},
url = {http://arxiv.org/abs/2510.19441},
doi = {10.48550/arXiv.2510.19441},
abstract = {The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these processes and the diversity of the modeled systems. While results about their steady state are well-known, very few exact results about their time evolution exist. Here, we introduce the conditional entropy of heat diffusion in graphs. We demonstrate that this entropic measure satisfies the first and second laws of thermodynamics, thereby providing a physical interpretation of diffusion dynamics on networks. We outline a mathematical framework that contextualizes diffusion and conditional entropy within the theories of continuous-time Markov chains and information theory. Furthermore, we obtain explicit results for its evolution on complete, path, and circulant graphs, as well as a mean-field approximation for Erdös-Rényi graphs. We also obtain asymptotic results for general networks. Finally, we experimentally demonstrate several properties of conditional entropy for diffusion over random graphs, such as the Watts-Strogatz model.},
urldate = {2026-03-17},
publisher = {arXiv},
author = {Koovely, Samuel and Bovet, Alexandre},
month = oct,
year = {2025},
note = {arXiv:2510.19441 [math]},
keywords = {diffusion, network science},
}
The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these processes and the diversity of the modeled systems. While results about their steady state are well-known, very few exact results about their time evolution exist. Here, we introduce the conditional entropy of heat diffusion in graphs. We demonstrate that this entropic measure satisfies the first and second laws of thermodynamics, thereby providing a physical interpretation of diffusion dynamics on networks. We outline a mathematical framework that contextualizes diffusion and conditional entropy within the theories of continuous-time Markov chains and information theory. Furthermore, we obtain explicit results for its evolution on complete, path, and circulant graphs, as well as a mean-field approximation for Erdös-Rényi graphs. We also obtain asymptotic results for general networks. Finally, we experimentally demonstrate several properties of conditional entropy for diffusion over random graphs, such as the Watts-Strogatz model.
Quantifying the Spread of Online Incivility in Brazilian Politics.
Zhang, Y.; Amsler, M.; Herrero, L. C.; Esser, F.; and Bovet, A.
In
Proceedings of the International AAAI Conference on Web and Social Media, volume 19, pages 2241–2259, June 2025.
Paper
doi
link
bibtex
abstract
@inproceedings{zhangQuantifyingSpreadOnline2025,
title = {Quantifying the {Spread} of {Online} {Incivility} in {Brazilian} {Politics}},
volume = {19},
copyright = {All rights reserved},
issn = {2334-0770, 2162-3449},
url = {https://ojs.aaai.org/index.php/ICWSM/article/view/35931},
doi = {10.1609/icwsm.v19i1.35931},
abstract = {Incivility refers to behaviors that violate collective norms and disrupt cooperation within the political process. Although large-scale online data and automated techniques have enabled the quantitative analysis of uncivil discourse, prior research has predominantly focused on impoliteness or toxicity, often overlooking other behaviors that undermine democratic values. To address this gap, we propose a multidimensional conceptual framework encompassing Impoliteness (IMP), Physical Harm and Violent Political Rhetoric (PHAVPR), Hate Speech and Stereotyping (HSST), and Threats to Democratic Institutions and Values (THREAT). Using this framework, we measure the spread of online political incivility in Brazil using approximately 5 million tweets posted by 2,307 political influencers during the 2022 Brazilian general election. Through statistical modeling and network analysis, we examine the dynamics of uncivil posts at different election stages, identify key disseminators and audiences, and explore the mechanisms driving the spread of uncivil information online. Our findings indicate that impoliteness is more likely to surge during election campaigns. In contrast, the other dimensions of incivility are often triggered by specific violent events. Moreover, we find that left-aligned individual influencers are the primary disseminators of online incivility in the Brazilian Twitter/X sphere and that they disseminate not only direct incivility but also indirect incivility when discussing or opposing incivility expressed by others. They relay those content from politicians, media agents, and individuals to reach broader audiences, revealing a diffusion pattern mixing the direct and two-step flows of communication theory. This study offers new insights into the multidimensional nature of incivility in Brazilian politics and provides a conceptual framework that can be extended to other political contexts.},
urldate = {2025-09-15},
booktitle = {Proceedings of the {International} {AAAI} {Conference} on {Web} and {Social} {Media}},
author = {Zhang, Yuan and Amsler, Michael and Herrero, Laia Castro and Esser, Frank and Bovet, Alexandre},
month = jun,
year = {2025},
keywords = {computational social science, network science, social media},
pages = {2241--2259},
}
Incivility refers to behaviors that violate collective norms and disrupt cooperation within the political process. Although large-scale online data and automated techniques have enabled the quantitative analysis of uncivil discourse, prior research has predominantly focused on impoliteness or toxicity, often overlooking other behaviors that undermine democratic values. To address this gap, we propose a multidimensional conceptual framework encompassing Impoliteness (IMP), Physical Harm and Violent Political Rhetoric (PHAVPR), Hate Speech and Stereotyping (HSST), and Threats to Democratic Institutions and Values (THREAT). Using this framework, we measure the spread of online political incivility in Brazil using approximately 5 million tweets posted by 2,307 political influencers during the 2022 Brazilian general election. Through statistical modeling and network analysis, we examine the dynamics of uncivil posts at different election stages, identify key disseminators and audiences, and explore the mechanisms driving the spread of uncivil information online. Our findings indicate that impoliteness is more likely to surge during election campaigns. In contrast, the other dimensions of incivility are often triggered by specific violent events. Moreover, we find that left-aligned individual influencers are the primary disseminators of online incivility in the Brazilian Twitter/X sphere and that they disseminate not only direct incivility but also indirect incivility when discussing or opposing incivility expressed by others. They relay those content from politicians, media agents, and individuals to reach broader audiences, revealing a diffusion pattern mixing the direct and two-step flows of communication theory. This study offers new insights into the multidimensional nature of incivility in Brazilian politics and provides a conceptual framework that can be extended to other political contexts.
Longitudinal modularity, a modularity for link streams.
Brabant, V.; Asgari, Y.; Borgnat, P.; Bonifati, A.; and Cazabet, R.
EPJ Data Science, 14(1): 12. December 2025.
Paper
doi
link
bibtex
abstract
@article{brabantLongitudinalModularityModularity2025,
title = {Longitudinal modularity, a modularity for link streams},
volume = {14},
copyright = {© The Author(s) 2025},
issn = {2193-1127},
url = {https://epjds.epj.org/articles/epjdata/abs/2025/01/13688_2025_Article_529/13688_2025_Article_529.html},
doi = {10.1140/epjds/s13688-025-00529-x},
abstract = {Temporal networks are commonly used to model real-life phenomena. When these phenomena represent interactions and are captured at a fine-grained temporal resolution, they are modeled as link streams. Community detection is an essential network analysis task. Although many methods exist for static networks, and some methods have been developed for temporal networks represented as sequences of snapshots, few works can handle directly link streams. This article introduces the first adaptation of the well-known Modularity quality function to link streams. Unlike existing methods, it is independent of the time scale of analysis. After introducing the quality function, and its relation to existing static and dynamic definitions of Modularity, we show experimentally its relevance for dynamic community evaluation.},
language = {en},
number = {1},
urldate = {2026-03-13},
journal = {EPJ Data Science},
publisher = {Springer Berlin Heidelberg},
author = {Brabant, Victor and Asgari, Yasaman and Borgnat, Pierre and Bonifati, Angela and Cazabet, Rémy},
month = dec,
year = {2025},
keywords = {community detection, network science, temporal networks},
pages = {12},
}
Temporal networks are commonly used to model real-life phenomena. When these phenomena represent interactions and are captured at a fine-grained temporal resolution, they are modeled as link streams. Community detection is an essential network analysis task. Although many methods exist for static networks, and some methods have been developed for temporal networks represented as sequences of snapshots, few works can handle directly link streams. This article introduces the first adaptation of the well-known Modularity quality function to link streams. Unlike existing methods, it is independent of the time scale of analysis. After introducing the quality function, and its relation to existing static and dynamic definitions of Modularity, we show experimentally its relevance for dynamic community evaluation.
Graph spring neural ODEs for link sign prediction.
Rehmann, A.; and Bovet, A.
Machine Learning, 114(7): 152. July 2025.
Paper
doi
link
bibtex
abstract
@article{rehmannGraphSpringNeural2025,
title = {Graph spring neural {ODEs} for link sign prediction},
volume = {114},
copyright = {Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License},
issn = {0885-6125, 1573-0565},
url = {https://link.springer.com/10.1007/s10994-025-06794-1},
doi = {10.1007/s10994-025-06794-1},
abstract = {Signed graphs allow for encoding positive and negative relations between nodes and are used to model various online activities. Node representation learning for signed graphs is a well-studied task with important applications such as sign prediction. While the size of datasets is ever-increasing, recent methods often sacrifice scalability for accuracy. We propose a novel message-passing layer architecture called graph spring network (GSN) modeled after spring forces. We combine it with a graph neural ordinary differential equations (ODEs) formalism to optimize the system dynamics in embedding space to solve a downstream prediction task. Once the dynamics is learned, embedding generation for novel datasets is done by solving the ODEs in time using a numerical integration scheme. Our GSN layer leverages the fast-to-compute edge vector directions and learnable scalar functions that only depend on nodes’ distances in latent space to compute the nodes’ positions. Conversely, graph convolution and graph attention network layers rely on learnable vector functions that require the full positions of input nodes in latent space. We propose a specific implementation called spring-neural-network using a set of small neural networks mimicking attracting and repulsing spring forces that we train for link sign prediction. Experiments show that our method achieves accuracy close to the state-of-the-art methods with node generation time speedups factor of up to 28,000 on large graphs.},
language = {en},
number = {7},
urldate = {2025-10-08},
journal = {Machine Learning},
author = {Rehmann, Andrin and Bovet, Alexandre},
month = jul,
year = {2025},
keywords = {network science},
pages = {152},
}
Signed graphs allow for encoding positive and negative relations between nodes and are used to model various online activities. Node representation learning for signed graphs is a well-studied task with important applications such as sign prediction. While the size of datasets is ever-increasing, recent methods often sacrifice scalability for accuracy. We propose a novel message-passing layer architecture called graph spring network (GSN) modeled after spring forces. We combine it with a graph neural ordinary differential equations (ODEs) formalism to optimize the system dynamics in embedding space to solve a downstream prediction task. Once the dynamics is learned, embedding generation for novel datasets is done by solving the ODEs in time using a numerical integration scheme. Our GSN layer leverages the fast-to-compute edge vector directions and learnable scalar functions that only depend on nodes’ distances in latent space to compute the nodes’ positions. Conversely, graph convolution and graph attention network layers rely on learnable vector functions that require the full positions of input nodes in latent space. We propose a specific implementation called spring-neural-network using a set of small neural networks mimicking attracting and repulsing spring forces that we train for link sign prediction. Experiments show that our method achieves accuracy close to the state-of-the-art methods with node generation time speedups factor of up to 28,000 on large graphs.