activity
20012025
most citedPlurality Consensus in the Gossip Model

43 citations · 115 across the 27 of their papers we have counts for

collaborators

33 papers

cs.DC2025

Threshold-Driven Streaming Graph: Expansion and Rumor Spreading

Flora Angileri, Andrea Clementi, Emanuele Natale +2

A randomized distributed algorithm called RAES was introduced in [Becchetti et al., SODA 2020] to extract a bounded-degree expander from a dense -vertex expander graph $G = (V,…

cs.DC2023

The Minority Dynamics and the Power of Synchronicity

Luca Becchetti, Andrea Clementi, Francesco Pasquale +3

We study the minority-opinion dynamics over a fully-connected network of nodes with binary opinions. Upon activation, a node receives a sample of opinions from a limited number…

cs.DC2023

On the Role of Memory in Robust Opinion Dynamics

Luca Becchetti, Andrea Clementi, Amos Korman +3

We investigate opinion dynamics in a fully-connected system, consisting of identical and anonymous agents, where one of the opinions (which is called correct) represents a piec…

cs.NE2022

On the Multidimensional Random Subset Sum Problem

Luca Becchetti, Arthur Carvalho Walraven da Cunha, Andrea Clementi +4

In the Random Subset Sum Problem, given i.i.d. random variables , we wish to approximate any point as the sum of a suitable subset $X_{i_1(z)}, ..…

math.PR2022

Bond Percolation in Small-World Graphs with Power-Law Distribution

Luca Becchetti, Andrea Clementi, Francesco Pasquale +2

\emph{Full-bond percolation} with parameter is the process in which, given a graph, for every edge independently, we delete the edge with probability . Bond percolation is…

math.PR2021

Percolation and Epidemic Processes in One-Dimensional Small-World Networks

Luca Becchetti, Andrea Clementi, Riccardo Denni +3

We obtain tight thresholds for bond percolation on one-dimensional small-world graphs, and apply such results to obtain tight thresholds for the \emph{Independent Cascade} process…