Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Clementi, Andrea"'
We consider the task of performing Jaccard similarity queries over a large collection of items that are dynamically updated according to a streaming input model. An item here is a subset of a large universe $U$ of elements. A well-studied approach to
Externí odkaz:
http://arxiv.org/abs/2407.21614
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
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
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 study expansion and information diffusion in dynamic networks, that is in networks in which nodes and edges are continuously created and destroyed. We consider information diffusion by {\em flooding}, the process by which, once a node is informed,
Externí odkaz:
http://arxiv.org/abs/2007.14681
Publikováno v:
SPAA 2020: 32nd ACM Symposium on Parallelism in Algorithms and Architectures Proceedings
We study parallel \emph{Load Balancing} protocols for a client-server distributed model defined as follows. There is a set $\sC$ of $n$ clients and a set $\sS$ of $n$ servers where each client has (at most) a constant number $d \geq 1$ of requests th
Externí odkaz:
http://arxiv.org/abs/2005.13583
In several real \emph{Multi-Agent Systems} (MAS), it has been observed that only weaker forms of\emph{metastable consensus} are achieved, in which a large majority of agents agree on some opinion while other opinions continue to be supported by a (sm
Externí odkaz:
http://arxiv.org/abs/2005.07423