activity
20012026
most citedThe Rise of Social Bots

1.6k citations · 11.6k across the 88 of their papers we have counts for

collaborators
Showing physics.soc-phShow all

18 papers · 1 filter

physics.soc-ph2025

Detectability threshold in weighted modular networks

Filippo Radicchi, Filipi N. Silva, Alessandro Flammini +2

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-partiti…

physics.soc-ph2025

Scale invariance and statistical significance in complex weighted networks

Filipi N. Silva, Sadamori Kojaku, Alessandro Flammini +2

Most networks encountered in nature, society, and technology have weighted edges, representing the strength of the interaction/association between their vertices. Randomizing the s…

physics.soc-ph2021★ 49 cited

Universality, criticality and complexity of information propagation in social media

Daniele Notarmuzi, Claudio Castellano, Alessandro Flammini +2

Information avalanches in social media are typically studied in a similar fashion as avalanches of neuronal activity in the brain. Whereas a large body of literature reveals substa…

physics.soc-ph2021★ 7 cited

Percolation theory of self-exciting temporal processes

Daniele Notarmuzi, Claudio Castellano, Alessandro Flammini +2

We investigate how the properties of inhomogeneous patterns of activity, appearing in many natural and social phenomena, depend on the temporal resolution used to define individual…

physics.soc-ph2020★ 16 cited

Classes of critical avalanche dynamics in complex networks

Filippo Radicchi, Claudio Castellano, Alessandro Flammini +2

Dynamical processes exhibiting absorbing states are essential in the modeling of a large variety of situations from material science to epidemiology and social sciences. Such proce…

physics.soc-ph2018★ 62 cited

Weight Thresholding on Complex Networks

Xiaoran Yan, Lucas G. S. Jeub, Alessandro Flammini +2

Weight thresholding is a simple technique that aims at reducing the number of edges in weighted networks that are otherwise too dense for the application of standard graph theoreti…