How to Spread a Rumor

Abstract

We study the problem of randomized information dissemination in networks. We compare the now standard push-pull protocol, with agent-based alternatives where information is disseminated by a collection of agents performing independent random walks. In the visit-exchange protocol, both nodes and agents store information, and each time an agent visits a node, the two exchange all the information they have. In the meet-exchange protocol, only the agents store information, and exchange their information with each agent they meet. We consider the broadcast time of a single piece of information in an n-node graph for the above three protocols, assuming a linear number of agents that start from the stationary distribution. We observe that there are graphs on which the agent-based protocols are significantly faster than push-pull, and graphs where the converse is true. We attribute the good performance of agent-based algorithms to their inherently fair bandwidth utilization, and conclude that, in certain settings, agent-based information dissemination, separately or in combination with push-pull, can significantly improve the broadcast time. The graphs considered above are highly non-regular. Our main technical result is that on any regular graph of at least logarithmic degree, push-pull and visit-exchange have the same asymptotic broadcast time. The proof uses a novel coupling argument which relates the random choices of vertices in push-pull with the random walks in visit-exchange. Further, we show that the broadcast time of meet-exchange is asymptotically at least as large as the other two's on all regular graphs, and strictly larger on some regular graphs. As far as we know, this is the first systematic and thorough comparison of the running times of these very natural information dissemination protocols. CCS CONCEPTS • Computing methodologies → Distributed algorithms; • Mathematics of computing → Stochastic processes.

Influence Maximization in Multiagent Systems by a Graph Embedding Method: Dealing With Probabilistically Unstable Links

“…For example, in Fig. 2, the link between agent a 7 and a 9 is unstable and the availability probability of this link is p 2 (7,9) . At every diffusion iteration, a 7 and a 9 will give probability values p 7(7,9) and p 9 (7,9) , respectively.…”

“…. As long as p 7(7,9) > p 2(7,9) and p 9(7,9) > p 2 (7,9) , the link is available for the influence diffusion. In addition, in Fig.…”

“…Generally, graph embedding approaches fall into three main categories: factorization methods [7], [39], random walks [9], [38], and deep learning [14]. Factorization methods typically take a long time to run, for instance, the Spectral Clustering of GE had the time complexity O(n 3 ).…”

On the effectiveness of random walks for modeling epidemics on networks

“…A second class of random-walk models includes models where several random walks occur simultaneously in the network, mimicking the actual dynamics of viruses and agents [ 11 – 13 ]. This approach fits into the general theory of agent-based methods: many variants have been proposed in the literature, sometimes with high degrees of sophistication; see, e.g., [ 14 – 18 ].…”

A Continuous-Time Urn Model for a System of Activated Particles

“…See [1] for more details. A nice application of such models involves the problem of randomized information dissemination in networks for rumor-spread modeling [2]. Indeed, each active particle possesses information that it shares with a particle in standby mode when the former jumps to the latter.…”