43 citations · 81 across the 14 of their papers we have counts for
14 papers
Plurality Consensus in the Gossip Model
L. Becchetti, A. Clementi, E. Natale +2
We study Plurality Consensus in the Gossip Model over a network of anonymous agents. Each agent supports an initial opinion or color. We assume that at the onset, the number of…
Simple Dynamics for Plurality Consensus
Luca Becchetti, Andrea Clementi, Emanuele Natale +3
We study a \emph{Plurality-Consensus} process in which each of anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set …
Rumor Spreading in Random Evolving Graphs
Andrea Clementi, Pierluigi Crescenzi, Carola Doerr +5
Randomized gossip is one of the most popular way of disseminating information in large scale networks. This method is appreciated for its simplicity, robustness, and efficiency. In…
Distributed Community Detection in Dynamic Graphs
Andrea Clementi, Miriam di Ianni, Giorgio Gambosi +2
Inspired by the increasing interest in self-organizing social opportunistic networks, we investigate the problem of distributed detection of unknown communities in dynamic random g…
Information Spreading in Dynamic Graphs
Andrea Clementi, Riccardo Silvestri, Luca Trevisan
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a rando…
Flooding Time in Opportunistic Networks under Power Law and Exponential Inter-Contact Times
Luca Becchetti, Andrea Clementi, Francesco Pasquale +3
Performance bounds for opportunistic networks have been derived in a number of recent papers for several key quantities, such as the expected delivery time of a unicast message, or…