Zobrazeno 1 - 10
of 356
pro vyhledávání: '"TREVISAN, LUCA"'
Autor:
Becchetti, Luca, Clementi, Andrea, Pasquale, Francesco, Trevisan, Luca, Vacus, Robin, Ziccardi, Isabella
We study the minority-opinion dynamics over a fully-connected network of $n$ nodes with binary opinions. Upon activation, a node receives a sample of opinions from a limited number of neighbors chosen uniformly at random. Each activated node then ado
Externí odkaz:
http://arxiv.org/abs/2310.13558
We give new rounding schemes for SDP relaxations for the problems of maximizing cubic polynomials over the unit sphere and the $n$-dimensional hypercube. In both cases, the resulting algorithms yield a $O(\sqrt{n/k})$ multiplicative approximation in
Externí odkaz:
http://arxiv.org/abs/2310.00393
Autor:
Becchetti, Luca, Clementi, Andrea, Korman, Amos, Pasquale, Francesco, Trevisan, Luca, Vacus, Robin
We investigate opinion dynamics in a fully-connected system, consisting of $n$ identical and anonymous agents, where one of the opinions (which is called correct) represents a piece of information to disseminate. In more detail, one source agent init
Externí odkaz:
http://arxiv.org/abs/2302.08600
Autor:
Becchetti, Luca, da Cunha, Arthur Carvalho Walraven, Clementi, Andrea, d'Amore, Francesco, Lesfari, Hicham, Natale, Emanuele, Trevisan, Luca
In the Random Subset Sum Problem, given $n$ i.i.d. random variables $X_1, ..., X_n$, we wish to approximate any point $z \in [-1,1]$ as the sum of a suitable subset $X_{i_1(z)}, ..., X_{i_s(z)}$ of them, up to error $\varepsilon$. Despite its simple
Externí odkaz:
http://arxiv.org/abs/2207.13944
\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is studied in pa
Externí odkaz:
http://arxiv.org/abs/2205.08774
Autor:
d'Orsi, Tommaso, Trevisan, Luca
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 results on polynomial-time strong refutations of random constraint satisfac
Externí odkaz:
http://arxiv.org/abs/2204.10881
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 latent clustering that has been corrupted by random noise and adversarial m
Externí odkaz:
http://arxiv.org/abs/2108.04729
Publikováno v:
In Theoretical Computer Science 1 October 2024 1011
Autor:
Becchetti, Luca, Clementi, Andrea, Denni, Riccardo, Pasquale, Francesco, Trevisan, Luca, Ziccardi, Isabella
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 and the \emph{Reed-Frost} process in such graphs. These are the first
Externí odkaz:
http://arxiv.org/abs/2103.16398
We prove that a random $d$-regular graph, with high probability, is a cut sparsifier of the clique with approximation error at most $\left(2\sqrt{\frac 2 \pi} + o_{n,d}(1)\right)/\sqrt d$, where $2\sqrt{\frac 2 \pi} = 1.595\ldots$ and $o_{n,d}(1)$ de
Externí odkaz:
http://arxiv.org/abs/2008.05648