Related papers: Infectious Random Walks
The dynamics of information dissemination in social networks is of paramount importance in processes such as rumors or fads propagation, spread of product innovations or "word-of-mouth" communications. Due to the difficulty in tracking a…
In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are…
During epidemics, the population is asked to Socially Distance, with pairs of individuals keeping two meters apart. We model this as a new optimization problem by considering a team of agents placed on the nodes of a network. Their common…
The Push, the Pull and the Push&Pull algorithms are well-studied rumor spreading protocols. In all three, in the beginning one node of a graph is informed. In the Push setting, every round every informed node chooses a neighbor uniformly at…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may…
We study different mechanisms of gossip propagation on several network topologies and introduce a new network property, the "spread factor", describing the fraction of neighbors that get to know the gossip. We postulate that for scale-free…
This paper focuses on non-asymptotic diffusion time in asynchronous gossip protocols. Asynchronous gossip protocols are designed to perform distributed computation in a network of nodes by randomly exchanging messages on the associated…
We study the optimal transmission and scheduling policy for a transmitter (source) communicating with two gossiping receivers aiming at tracking the source's status over time using the age of information (AoI) metric. Gossiping enables…
The patterns of motion of mobile agents has received recently wide attention in the literature. There is a number of recent studies centered around the motion behavior of many agents ranging from albatrosses to human beings. Special…
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, $k$-gossip, there are $k$ pieces of information (or tokens) that are initially present in some nodes and the…
We study randomized gossip-based processes in dynamic networks that are motivated by discovery processes in large-scale distributed networks like peer-to-peer or social networks. A well-studied problem in peer-to-peer networks is the…
In this paper, we propose an agent-based model of information spread, grounded on psychological insights on the formation and spread of beliefs. In our model, we consider a network of individuals who share two opposing types of information…
We study the spread of a persuasive new idea through a population of continuous-time random walkers in one dimension. The idea spreads via social gatherings involving groups of nearby walkers who act according to a biased "majority rule":…
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph $G$ with $n$ nodes such that, the protocol informs…
We study the randomized rumor spreading algorithm \emph{pull} on complete graphs with $n$ vertices. Starting with one informed vertex and proceeding in rounds, each vertex yet uninformed connects to a neighbor chosen uniformly at random and…
We study the popular randomized rumour spreading protocol Push. Initially, a node in a graph possesses some information, which is then spread in a round based manner. In each round, each informed node chooses uniformly at random one of its…
In most social and information systems the activity of agents generates rapidly evolving time-varying networks. The temporal variation in networks' connectivity patterns and the ongoing dynamic processes are usually coupled in ways that…
Distributed computing models typically assume reliable communication between processors. While such assumptions often hold for engineered networks, e.g., due to underlying error correction protocols, their relevance to biological systems,…
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…