activity
20042023
most citedInapproximability of Combinatorial Optimization Problems

18 citations · 89 across the 32 of their papers we have counts for

collaborators

46 papers

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…

cs.CC2022

A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs

Tommaso d'Orsi, Luca Trevisan

We define a novel notion of ``non-backtracking'' matrix associated to any symmetric matrix, and we prove a ``Ihara-Bass'' type formula for it. We use this theory to prove new resul…

cs.DS2021

Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models

Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re +1

Correlation Clustering is an important clustering problem with many applications. We study the reconstruction version of this problem in which one is seeking to reconstruct a laten…

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…