Add to ORKG1. The ground is a simple connected graph. 2. At time 0, one vertex knows a rumour. 3. At each time-step 1, 2,..., every informed vertex tells the rumour to a random neighbour
International audienceWe consider the well-studied rumor spreading model in which nodes contact a ra...
Rumor source detection for rumor spreading on random increasing trees Michael Fuchs * Pei-Duo Yu* In...
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations t...
1. The ground is a simple connected graph. 2. At time 0, one vertex knows a rumour. 3. At each time-...
Abstract. In this paper, we provide a detailed comparison between a fully randomized protocol for ru...
We show that if a connected graph with n nodes has conductance φ then rumour spreading, also known a...
We consider the popular and well-studied push model, which is used to spread information in a given ...
In a recent paper, Shah and Zaman proposed the rumor center as an effective rumor source estimator f...
We consider the popular and well-studied push model, which is used to spread information in a given ...
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to...
We consider the problem of detecting the source of a rumor (information diffusion) in a network base...
In this paper, we provide a detailed comparison between a fully randomized protocol for rumour sprea...
We show that if a connected graph with n nodes has conductance φ then rumour spreading, also known a...
The Spatial Preferential Attachment model is a spatial random graph used to model social networks. N...
In this paper, we provide a detailed comparison between a fully randomized protocol for rumour spre...
International audienceWe consider the well-studied rumor spreading model in which nodes contact a ra...
Rumor source detection for rumor spreading on random increasing trees Michael Fuchs * Pei-Duo Yu* In...
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations t...
1. The ground is a simple connected graph. 2. At time 0, one vertex knows a rumour. 3. At each time-...
Abstract. In this paper, we provide a detailed comparison between a fully randomized protocol for ru...
We show that if a connected graph with n nodes has conductance φ then rumour spreading, also known a...
We consider the popular and well-studied push model, which is used to spread information in a given ...
In a recent paper, Shah and Zaman proposed the rumor center as an effective rumor source estimator f...
We consider the popular and well-studied push model, which is used to spread information in a given ...
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to...
We consider the problem of detecting the source of a rumor (information diffusion) in a network base...
In this paper, we provide a detailed comparison between a fully randomized protocol for rumour sprea...
We show that if a connected graph with n nodes has conductance φ then rumour spreading, also known a...
The Spatial Preferential Attachment model is a spatial random graph used to model social networks. N...
In this paper, we provide a detailed comparison between a fully randomized protocol for rumour spre...
International audienceWe consider the well-studied rumor spreading model in which nodes contact a ra...
Rumor source detection for rumor spreading on random increasing trees Michael Fuchs * Pei-Duo Yu* In...
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations t...