Alessandro Flammini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alessandro Flammini has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Filippo Menczer
Observatory on Social Media, Indiana University, Bloomington, Indiana, USA
12 shared publications - Emilio Ferrara
University of Southern California, Los Angeles, CA, USA
5 shared publications - Santo Fortunato
Indiana University Bloomington
4 shared publications - Alessandro Vespignani
Network Science Institute, Northeastern University, Boston, MA, USA
2 shared publications - Alexander C. Nwala
Department of Data Science, William & Mary, Williamsburg, Virginia, USA
2 shared publications - Aram Galstyan
University of Southern California ♠ University of California Los Angeles ♡ The
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4719-4728
Adversarial Creation and Detection of AI-Generated Social Bot Content
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4719-4728
Open AccessAdversarial Creation and Detection of AI-Generated Social Bot Content
- Open Access
- 25 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 349-358
Behavior Change as a Signal for Identifying Social Media Manipulation
- 25 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 349-358
Open AccessBehavior Change as a Signal for Identifying Social Media Manipulation
- 30 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014318
Detectability threshold in weighted modular networks
We study the necessary condition to detect, by means of spectral modularity optimization, the ground-truth partition in networks generated according to the weighted planted-partition model with two equally sized communities. We analytically derive a general expression for the maximum level of mixing tolerated by the algorithm to retrieve community structure, showing that the value of this detectability threshold depends on the first two moments of the distributions of node degree and edge weight. We focus on the standard case of Poisson-distributed node degrees and compare the detectability thresholds of five edge-weight distributions: Dirac, Poisson, exponential, geometric, and signed Bernoulli. We show that Dirac distributed weights yield the smallest detectability threshold, while exponentially distributed weights increase the threshold by a factor of sqrt[2], with other distributions exhibiting distinct behaviors that depend, either or both, on the average values of the degree and weight distributions. Our results indicate that larger variability in edge weights can make communities less detectable. In cases where edge weights carry no information about community structure, incorporating edge weights in community detection is detrimental.
- 30 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014318
Detectability threshold in weighted modular networks
We study the necessary condition to detect, by means of spectral modularity optimization, the ground-truth partition in networks generated according to the weighted planted-partition model with two equally sized communities. We analytically derive a general expression for the maximum level of mixing tolerated by the algorithm to retrieve community structure, showing that the value of this detectability threshold depends on the first two moments of the distributions of node degree and edge weight. We focus on the standard case of Poisson-distributed node degrees and compare the detectability thresholds of five edge-weight distributions: Dirac, Poisson, exponential, geometric, and signed Bernoulli. We show that Dirac distributed weights yield the smallest detectability threshold, while exponentially distributed weights increase the threshold by a factor of sqrt[2], with other distributions exhibiting distinct behaviors that depend, either or both, on the average values of the degree and weight distributions. Our results indicate that larger variability in edge weights can make communities less detectable. In cases where edge weights carry no information about community structure, incorporating edge weights in community detection is detrimental.
- Open Access
- 19 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 348-357
Can Large Language Models Effectively Mitigate Polarization in Social Media Text?
- 19 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 348-357
Open AccessCan Large Language Models Effectively Mitigate Polarization in Social Media Text?
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1234-1238
Beyond Interaction Patterns: Assessing Claims of Coordinated Inter-State Information Operations on Twitter/X
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1234-1238
Open AccessBeyond Interaction Patterns: Assessing Claims of Coordinated Inter-State Information Operations on Twitter/X
- Open Access
- 12 April 2024
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 10 (15) , eadh4439
Emergence of simple and complex contagion dynamics from weighted belief networks
Social contagion is a ubiquitous and fundamental process that drives individual and social changes. Although social contagion arises as a result of cognitive processes and biases, the integration of cognitive mechanisms with the theory of social contagion remains an open challenge. In particular, studies on social phenomena usually assume contagion dynamics to be either simple or complex, rather than allowing it to emerge from cognitive mechanisms, despite empirical evidence indicating that a social system can exhibit a spectrum of contagion dynamics—from simple to complex—simultaneously. Here, we propose a model of interacting beliefs, from which both simple and complex contagion dynamics can organically arise. Our model also elucidates how a fundamental mechanism of complex contagion—resistance—can come about from cognitive mechanisms.
- 12 April 2024
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 10 (15) , eadh4439
Open AccessEmergence of simple and complex contagion dynamics from weighted belief networks
Social contagion is a ubiquitous and fundamental process that drives individual and social changes. Although social contagion arises as a result of cognitive processes and biases, the integration of cognitive mechanisms with the theory of social contagion remains an open challenge. In particular, studies on social phenomena usually assume contagion dynamics to be either simple or complex, rather than allowing it to emerge from cognitive mechanisms, despite empirical evidence indicating that a social system can exhibit a spectrum of contagion dynamics—from simple to complex—simultaneously. Here, we propose a model of interacting beliefs, from which both simple and complex contagion dynamics can organically arise. Our model also elucidates how a fundamental mechanism of complex contagion—resistance—can come about from cognitive mechanisms.
- 21 February 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 107 (2) , 024310
Critical avalanches of susceptible-infected-susceptible dynamics in finite networks
We investigate the avalanche temporal statistics of the susceptible-infected-susceptible (SIS) model when the dynamics is critical and takes place on finite random networks. By considering numerical simulations on annealed topologies we show that the survival probability always exhibits three distinct dynamical regimes. Size-dependent crossover timescales separating them scale differently for homogeneous and for heterogeneous networks. The phenomenology can be qualitatively understood based on known features of the SIS dynamics on networks. A fully quantitative approach based on Langevin theory is shown to perfectly reproduce the results for homogeneous networks, while failing in the heterogeneous case. The analysis is extended to quenched random networks, which behave in agreement with the annealed case for strongly homogeneous and strongly heterogeneous networks.
- 21 February 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 107 (2) , 024310
Critical avalanches of susceptible-infected-susceptible dynamics in finite networks
We investigate the avalanche temporal statistics of the susceptible-infected-susceptible (SIS) model when the dynamics is critical and takes place on finite random networks. By considering numerical simulations on annealed topologies we show that the survival probability always exhibits three distinct dynamical regimes. Size-dependent crossover timescales separating them scale differently for homogeneous and for heterogeneous networks. The phenomenology can be qualitatively understood based on known features of the SIS dynamics on networks. A fully quantitative approach based on Langevin theory is shown to perfectly reproduce the results for homogeneous networks, while failing in the heterogeneous case. The analysis is extended to quenched random networks, which behave in agreement with the annealed case for strongly homogeneous and strongly heterogeneous networks.
- Open Access
- 9 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (1) , 1-34
Reconciling the Quality vs Popularity Dichotomy in Online Cultural Markets
We propose a simple model of an idealized online cultural market in which N items, endowed with a hidden quality metric, are recommended to users by a ranking algorithm possibly biased by the current items’ popularity. Our goal is to better understand the underlying mechanisms of the well-known fact that popularity bias can prevent higher-quality items from becoming more popular than lower-quality items, producing an undesirable misalignment between quality and popularity rankings. We do so under the assumption that users, having limited time/attention, are able to discriminate the best-quality only within a random subset of the items. We discover the existence of a harmful regime in which improper use of popularity can seriously compromise the emergence of quality, and a benign regime in which wise use of popularity, coupled with a small discrimination effort on behalf of users, guarantees the perfect alignment of quality and popularity ranking. Our findings clarify the effects of algorithmic popularity bias on quality outcomes, and may inform the design of more principled mechanisms for techno-social cultural markets.
- 9 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (1) , 1-34
Open AccessReconciling the Quality vs Popularity Dichotomy in Online Cultural Markets
We propose a simple model of an idealized online cultural market in which N items, endowed with a hidden quality metric, are recommended to users by a ranking algorithm possibly biased by the current items’ popularity. Our goal is to better understand the underlying mechanisms of the well-known fact that popularity bias can prevent higher-quality items from becoming more popular than lower-quality items, producing an undesirable misalignment between quality and popularity rankings. We do so under the assumption that users, having limited time/attention, are able to discriminate the best-quality only within a random subset of the items. We discover the existence of a harmful regime in which improper use of popularity can seriously compromise the emergence of quality, and a benign regime in which wise use of popularity, coupled with a small discrimination effort on behalf of users, guarantees the perfect alignment of quality and popularity ranking. Our findings clarify the effects of algorithmic popularity bias on quality outcomes, and may inform the design of more principled mechanisms for techno-social cultural markets.
- Open Access
A General Language for Modeling Social Media Account Behavior
Malicious actors exploit social media to inflate stock prices, sway elections, spread misinformation, and sow discord. To these ends, they employ tactics that include the use of inauthentic accounts and campaigns. Methods to detect these abuses currently rely on features specifically designed to target suspicious behaviors. However, the effectiveness of these methods decays as malicious behaviors evolve. To address this challenge, we propose a general language for modeling social media account behavior. Words in this language, called BLOC, consist of symbols drawn from distinct alphabets representing user actions and content. The language is highly flexible and can be applied to model a broad spectrum of legitimate and suspicious online behaviors without extensive fine-tuning. Using BLOC to represent the behaviors of Twitter accounts, we achieve performance comparable to or better than state-of-the-art methods in the detection of social bots and coordinated inauthentic behavior.
Open AccessA General Language for Modeling Social Media Account Behavior
Malicious actors exploit social media to inflate stock prices, sway elections, spread misinformation, and sow discord. To these ends, they employ tactics that include the use of inauthentic accounts and campaigns. Methods to detect these abuses currently rely on features specifically designed to target suspicious behaviors. However, the effectiveness of these methods decays as malicious behaviors evolve. To address this challenge, we propose a general language for modeling social media account behavior. Words in this language, called BLOC, consist of symbols drawn from distinct alphabets representing user actions and content. The language is highly flexible and can be applied to model a broad spectrum of legitimate and suspicious online behaviors without extensive fine-tuning. Using BLOC to represent the behaviors of Twitter accounts, we achieve performance comparable to or better than state-of-the-art methods in the detection of social bots and coordinated inauthentic behavior.
- 22 June 2018
- Published by Springer Nature
- p. 213-228
Attention on Weak Ties in Social and Communication Networks
- 22 June 2018
- Published by Springer Nature
- p. 213-228
Attention on Weak Ties in Social and Communication Networks