Related papers: Critical thresholds in stochastic rumors on trees
The stacked contact process is a stochastic model for the spread of an infection within a population of hosts located on the $d$-dimensional integer lattice. Regardless of whether they are healthy or infected, hosts give birth and die at…
This paper discusses a simple stochastic model for the spread of messages in a large population with two types of individuals: transmitters and receivers. Transmitters, after receiving the message, start spreading copies of the message to…
Consider a rooted $N$-ary tree. To every vertex of this tree, we attach an i.i.d. continuous random variable. A vertex is called accessible if along its ancestral line, the attached random variables are increasing. We keep accessible…
Social networks are the major routes for most individuals to exchange their opinions about new products, social trends and political issues via their interactions. It is often of significant importance to figure out who initially diffuses…
We consider a network consisting of $n$ nodes connected in a ring formation and a source that generates updates according to a renewal process and disseminates them to the ring network according to a Poisson process. The nodes in the…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
Quantifying the virality of cascades is an important question across disciplines such as the transmission of disease, the spread of information and the diffusion of innovations. An appropriate virality metric should be able to disambiguate…
The branching-ruin number of a tree, which describes its asymptotic growth and geometry, can be seen as a polynomial version of the branching number. This quantity was defined by Collevecchio, Kious and Sidoravicius (2018) in order to…
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…
In this study, we looked at the effect of promotion in the speed and width of spread of information on the Internet by tracking the diffusion of news articles over a social network. Speed of spread means the number of readers that the news…
We consider a network of $n$ user nodes that receives updates from a source and employs an age-based gossip protocol for faster dissemination of version updates to all nodes. When a node forwards its packet to another node, the packet…
We consider a model for a social network with N interacting social actors. This model is a system of interacting marked point processes in which each point process indicates the successive times in which a social actor expresses a…
We consider three different schemes for signal routing on a tree. The vertices of the tree represent transceivers that can transmit and receive signals, and are equipped with i.i.d. weights representing the strength of the transceivers. The…
How an information spreads throughout a social network is a valuable knowledge sought by many groups such as marketing enterprises and political parties. If they can somehow predict the impact of a given message or manipulate it in order to…
We study a rumour propagation model along the lines of \cite{lebensztayn2008disk} as a long-range percolation model on $\Z$. We begin by showing a sharp phase transition-type behaviour in the sense of exponential decay of the survival time…
We empirically analyze two versions of the well-known "randomized rumor spreading" protocol to disseminate a piece of information in networks. In the classical model, in each round each informed node informs a random neighbor. In the…
We present a binary routing tree protocol for distributed hash table overlays. Using this protocol each peer can independently route messages to its parent and two descendants on the fly without any maintenance, global context, and…
We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information…
Network structure can have significant effects on the propagation of diseases, memes, and information on social networks. Such effects depend on the specific type of dynamical process that affects the nodes and edges of a network, and it is…
Fads, product adoption, mobs, rumors, memes, and emergent norms are diverse social contagions that have been modeled as network cascades. Empirical study of these cascades is vulnerable to what we describe as the "opacity problem": the…