Emanuele Natale

Learn More
We study the following synchronous process that we call repeated balls-into-bins. The process is started by assigning n balls to n bins in an arbitrary way. Then, in every subsequent round, one ball is chosen according to some fixed strategy (random, FIFO, etc) from each non-empty bin, and re-assigned to one of the n bins uniformly at random. This process(More)
We study Plurality Consensus in the GOSSIP Model over a network of n anonymous agents. Each agent supports an initial opinion or color. We assume that at the onset, the number of agents supporting the plurality color exceeds that of the agents supporting any other color by a sufficiently-large bias, though the initial plurality itself might be very far from(More)
We study a <i>Plurality Consensus</i> process in which each of <i>n</i> anonymous agents of a communication network supports an initial opinion (a colorchosen from a finite set [<i>k</i>]) and, at every time step, he can revise his color according to a random sample of neighbors. The goal (of the agents) is to let the process converge to the <i>stable</i>(More)
The twentieth century has seen the rise of a new type of video games targeted at a mass audience of " casual " gamers. Many of these games require the player to swap items in order to form matches of three and are collectively known as tile-matching match-three games. Among these, the most influential one is arguably Bejeweled in which the matched items(More)
We consider the following distributed consensus problem: Each node in a complete communication network of size n initially holds an opinion, which is chosen arbitrarily from a finite set Σ. The system must converge toward a consensus state in which all, or almost all nodes, hold the same opinion. Moreover, this opinion should be valid, i.e., it should be(More)
Inspired by the increasing interest in self-organizing social opportunistic networks, we investigate the problem of distributed detection of unknown communities in dynamic random graphs. As a formal framework, we consider the dynamic version of the well-studied Planted Bisection Model dyn-G(n, p, q) where the node set [n] of the network is partitioned into(More)
This paper studies the complexities of basic distributed computing tasks while operating under severe fault-tolerant contexts and strong communication constraints. We consider the self-stabilizing context, in which internal states of processors (agents) are initially chosen by an adversary. Furthermore, we assume that agents are passively mobile in the(More)
Given an underlying network, the averaging dynamics is the following distributed process: Initially , each node sets its local value to an element of {−1, 1}, uniformly at random and independently of other nodes. Then, in each consecutive round, every node updates its value to the average of its neighbors. We show that when the graph is organized into two(More)