Zobrazeno 1 - 10
of 136
pro vyhledávání: '"Becchetti, 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
Publikováno v:
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023). Pages 38-45
Opinion diffusion is a crucial phenomenon in social networks, often underlying the way in which a collective of agents develops a consensus on relevant decisions. The voter model is a well-known theoretical model to study opinion spreading in social
Externí odkaz:
http://arxiv.org/abs/2305.07377
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
Publikováno v:
Bioinformatics 38.17 (2022): 4145-4152
Motivation: Over the past decade, network-based approaches have proven useful in identifying disease modules within the human interactome, often providing insights into key mechanisms and guiding the quest for therapeutic targets. This is all the mor
Externí odkaz:
http://arxiv.org/abs/2211.13086
Motivation: Genome-wide association studies (GWAS) have successfully identified thousands of genetic risk loci for complex traits and diseases. Most of these GWAS loci lie in regulatory regions of the genome and the gene through which each GWAS risk
Externí odkaz:
http://arxiv.org/abs/2210.16292
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
Background:Typically, proteins perform key biological functions by interacting with each other. As a consequence, predicting which protein pairs interact is a fundamental problem. Experimental methods are slow, expensive, and may be error prone.Many
Externí odkaz:
http://arxiv.org/abs/2107.03694
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