Sandro Meloni

h-index29
2papers
4,446citations

2 Papers

7.3SOC-PHJun 25
On the Effects of Decentralized Moderation on Network Robustness and Information Diffusion in Mastodon

Beatriz Arregui-García, Lucio La Cava, Anees Baqir et al.

Decentralized online social networks such as Mastodon distribute moderation power across thousands of independently governed servers, raising fundamental questions about how local block decisions shape global structure and information flow. In this paper, we analyze Mastodon at the instance level by constructing a signed, directed, temporal network in which positive edges aggregate inter-instance follow relationships and negative edges encode daily block actions. Using one year of data, we show that despite continuous moderation activity and changing roles among instances, the network exhibits strong structural stability: signed dyadic motifs and degree distributions display highly persistent dynamics, and aggregated transition matrices satisfy Markovian equilibrium conditions over intermediate time scales. Building on the marked asymmetry between instances that predominantly issue bans and those that are mostly banned, we then study information diffusion on the positive network via a hybrid contagion model that combines simple contagion within groups and complex contagion across groups. We find that information originating in the minority of moderating instances spreads more efficiently, both internally and toward the majority, while the opposite direction is fragile and sensitive to contagion parameters. Echo-chamber effects emerge even in a globally balanced signed network and become stronger under stricter contagion conditions. Together, these results show that decentralized moderation in Mastodon generates a stable macroscopic configuration that both structures and constrains information exchange, effectively isolating norm-violating domains without centralized control.

2.5NEFeb 3, 2012
Influence of Topological Features on Spatially-Structured Evolutionary Algorithms Dynamics

Matteo De Felice, Sandro Meloni, Stefano Panzieri

In the last decades, complex networks theory significantly influenced other disciplines on the modeling of both static and dynamic aspects of systems observed in nature. This work aims to investigate the effects of networks' topological features on the dynamics of an evolutionary algorithm, considering in particular the ability to find a large number of optima on multi-modal problems. We introduce a novel spatially-structured evolutionary algorithm and we apply it on two combinatorial problems: ONEMAX and the multi-modal NMAX. Considering three different network models we investigate the relationships between their features, algorithm's convergence and its ability to find multiple optima (for the multi-modal problem). In order to perform a deeper analysis we investigate the introduction of weighted graphs with time-varying weights. The results show that networks with a large Average Path Length lead to an higher number of optima and a consequent slow exploration dynamics (i.e. low First Hitting Time). Furthermore, the introduction of weighted networks shows the possibility to tune algorithm's dynamics during its execution with the parameter related with weights' change. This work gives a first answer about the effects of various graph topologies on the diversity of evolutionary algorithms and it describes a simple but powerful algorithmic framework which allows to investigate many aspects of ssEAs dynamics.