相关论文: Tight Bounds on Information Dissemination in Spars…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…
The Aldous gossip process represents the dissemination of information in geographical space as a process of locally deterministic spread, augmented by random long range transmissions. Starting from a single initially informed individual,…
We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal fraction of neighbors of a given node that interchange information among each…
Interactions in time-varying complex systems are often very heterogeneous at the topological level (who interacts with whom) and at the temporal level (when interactions occur and how often). While it is known that temporal heterogeneities…
Junior, Machado and Zuluaga (2011) studied a model to understand the spread of a rumour. Their model consists of individuals situated at the integer points of the line $\N$. An individual at the origin $0$ starts a rumour and passes it to…
In dynamic graphs, edges may be added or deleted in each synchronous round. Various connectivity models exist based on constraints on these changes. One well-known model is the $T$-Interval Connectivity model, where the graph remains…
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 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":…
The Lieb-Robinson bound (LRB) states that the range and strength of interactions between the constituents of a complex many-body system impose upper limits to how fast the signal can propagate. It manifests in a light cone-like growth of…
We study a gossip protocol called forwarding without repeating (FWR). The objective is to spread multiple rumors over a graph as efficiently as possible. FWR accomplishes this by having nodes record which messages they have forwarded to…
Rumor models consider that information transmission occurs with the same probability between each pair of nodes. However, this assumption is not observed in social networks, which contain influential spreaders. To overcome this limitation,…
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 a gossip network, consisting of $n$ nodes, which tracks the information at a source. The source updates its information with a Poisson arrival process and also sends updates to the nodes in the network. The nodes themselves can…
Rumor spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumor is propagated by pairwise interactions between spreaders and ignorants. Spreaders can become stiflers only after…
We study lower bounds on information dissemination in adversarial dynamic networks. Initially, k pieces of information (henceforth called tokens) are distributed among n nodes. The tokens need to be broadcast to all nodes through a…
Spreading processes, e.g. epidemics, wildfires and rumors, are often modeled on static networks. However, their underlying network structures, e.g. changing contacts in social networks, different weather forecasts for wildfires, are due to…
We study epidemic spreading processes in large networks, when the spread is assisted by a small number of external agents: infection sources with bounded spreading power, but whose movement is unrestricted vis-\`a-vis the underlying network…
We introduce here a multi-type bootstrap percolation model, which we call T-Bootstrap Percolation (T-BP), and apply it to study information propagation in social networks. In this model, a social network is represented by a graph G whose…
The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Our first contribution is a rigorous framework for design and analysis of distributed…
Recently, the impacts of spatiotemporal heterogeneities of human activities on spreading dynamics have attracted extensive attention. In this paper, to study heterogeneous response times on information spreading, we focus on the…