Related papers: Rumor Spreading with Bounded In-Degree
Rumor propagation in social networks undermines social stability and public trust, calling for interventions that are both effective and resource-efficient. We develop a node-level, time-varying optimal intervention framework that allocates…
We study two rumor processes on $\N$, the dynamics of which are related to an SI epidemic model with long range transmission. Both models start with one spreader at site $0$ and ignorants at all the other sites of $\N$, but differ by the…
Social network is a main tunnel of rumor spreading. Previous studies are concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its…
Spreading truths is recognized as a feasible strategy for inhibiting rumors. This paper is devoted to assessing the effectiveness of the truth-spreading strategy. An individual-level rumor-truth spreading model (the generic URTU model) is…
We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…
This paper studies reliability of probabilistic neighbor-aware gossip algorithms over three well- known large-scale random topologies, namely Bernoulli (or Erd\H{o}s-R\'enyi) graph, the random geometric graph, and the scale-free graph. We…
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…
For the study of information propagation, one fundamental problem is uncovering universal laws governing the dynamics of information propagation. This problem, from the microscopic perspective, is formulated as estimating the propagation…
Algorithms for mutual exclusion aim to isolate potentially concurrent accesses to the same shared resources. Motivated by distributed computing research on programmable matter and population protocols where interactions among entities are…
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…
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…
Message passing neural networks have recently evolved into a state-of-the-art approach to representation learning on graphs. Existing methods perform synchronous message passing along all edges in multiple subsequent rounds and consequently…
A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the same message to all directly reachable nodes. Secondly, a…
The diffusion of rumors on microblogs generally follows a propagation tree structure, that provides valuable clues on how an original message is transmitted and responded by users over time. Recent studies reveal that rumor detection and…
In distributed environments, such as distributed ledgers technologies and other peer-to-peer architectures, communication represents a crucial topic. The ability to efficiently disseminate contents is strongly influenced by the type of…
We present a study of information flow that takes into account the observation that an item relevant to one person is more likely to be of interest to individuals in the same social circle than those outside of it. This is due to the fact…
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…
The spread of ideas in online social networks is a crucial phenomenon to understand nowadays the proliferation of fake news and their impact in democracies. This makes necessary to use models that mimic the circulation of rumors. The law of…
We consider the classical push broadcast process on a large class of sparse random multigraphs that includes random power law graphs and multigraphs. Our analysis shows that for every $\varepsilon>0$, whp $O(\log n)$ rounds are sufficient…
In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…