Related papers: Towards Constant Time Multi-Call Rumor Spreading o…
In this paper we show that gossip algorithms may be effectively used to disseminate game events in Peer-to-Peer (P2P) Multiplayer Online Games (MOGs). Game events are disseminated through an overlay network. The proposed scheme exploits the…
We examine a general stochastic rumor model characterized by specific parameters that govern the interaction rates among individuals. Our model includes the \((\alpha, p)\)-probability variants of the well-known Daley--Kendall and…
We consider a scenario of broadcasting information over a network of nodes connected by noiseless communication links. A source node in the network has some data packets to broadcast. It encodes these data packets into $n$ coded packets in…
The paper addresses a method for spreading messages in social networks through an initial acceleration by Spreading Groups. These groups start the spread which eventually reaches a larger portion of the network. The use of spreading groups…
We propose a rumor propagation model in which individuals within a homogeneously mixed population can assume one of infinitely many possible states. To analyze this model, we extend the classical law of large numbers for density-dependent…
We consider the Maki-Thompson model for the stochastic propagation of a rumour within a population. We extend the original hypothesis of homogenously mixed population by allowing for a small-world network embedding the model. This structure…
We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…
A new \emph{spanner} construction algorithm is presented, working under the \emph{LOCAL} model with unique edge IDs. Given an $n$-node communication graph, a spanner with a constant stretch and $O (n^{1 + \varepsilon})$ edges (for an…
We study the phenomenon of information propagation on mobile geometric scale-free random graphs, where vertices instantaneously pass on information to all other vertices in the same connected component. The graphs we consider are…
Consider the following broadcasting process run on a connected graph $G=(V,E)$. Suppose that $k \ge 2$ agents start on vertices selected from $V$ uniformly and independently at random. One of the agents has a message that she wants to…
We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computations and then communicate in order to aggregate information and synchronize their…
Aldous [(2007) Preprint] defined a gossip process in which space is a discrete $N\times N$ torus, and the state of the process at time $t$ is the set of individuals who know the information. Information spreads from a site to its nearest…
We consider the scenario of $n$ sensor nodes observing streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items observed by the nodes. In our case, there exists a total order…
A gossip process is an iterative process in a multi-agent system where only two neighboring agents communicate at each iteration and update their states. The neighboring condition is by convention described by an undirected graph. In this…
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…
We study the dynamics and intervention strategies of a rumor using the modified Maki-Thompson model. A key challenge in social networks is distinguishing between natural increases in transmissibility and artificial injections of rumor…
We consider the following multi--level opinion spreading model on networks. Initially, each node gets a weight from the set [0..k-1], where such a weight stands for the individuals conviction of a new idea or product. Then, by proceeding to…
In this paper, we study gossip algorithms in communication models that describe the peer-to-peer networking functionality included in most standard smartphone operating systems. We begin by describing and analyzing a new synchronous gossip…
The identification of the minimal set of nodes that maximizes the propagation of information is one of the most relevant problems in network science. In this paper, we introduce a new method to find the set of initial spreaders to maximize…
In the distributed triangle detection problem, we have an $n$-vertex network $G=(V,E)$ with one player for each vertex of the graph who sees the edges incident on the vertex. The players communicate in synchronous rounds using the edges of…