Results 1  10
of
96,696
Quasirandom Rumor Spreading
 In Proc. of SODA’08
, 2008
"... We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks (“randomized rumor spreading”). In the classical model, in each round each informed node chooses a neighbor at random and informs it. Results of Frieze and Grimmett (Discrete Appl. Mat ..."
Abstract

Cited by 39 (12 self)
 Add to MetaCart
. Math. 1985) show that this simple protocol succeeds in spreading a rumor from one node of a complete graph to all others within O(log n) rounds. For the network being a hypercube or a random graph G(n, p) with p ≥ (1+ε)(log n)/n, also O(log n) rounds suffice (Feige, Peleg, Raghavan, and Upfal, Random
Tight Bounds for Quasirandom Rumor Spreading
"... This paper addresses the following fundamental problem: Suppose that in a group of n people, where each person knows all other group members, a single person holds a piece of information that must be disseminated to everybody within the group. How should the people propagate the information so that ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
that after short time everyone is informed? The classical approach, known as the push model, requires that in each round, every informed person selects some other person in the group at random, whom it then informs. In a different model, known as the quasirandom push model, each person maintains a cyclic
Randomized rumor spreading
 In IEEE Symposium on Foundations of Computer Science
, 2000
"... We investigate the class of socalled epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms use a simple randomized communication mechanism to ensure robustness. Suppose players communicate in parallel rounds in each of ..."
Abstract

Cited by 282 (2 self)
 Add to MetaCart
of which every player calls a randomly selected communication partner. In every round, players can generate rumors (updates) that are to be distributed among all players. Whenever communication is established between two players, each one must decide which of the rumors to transmit. The major problem
RandomnessEfficient Rumor Spreading
, 1304
"... We study the classical rumor spreading problem, which is used to spread information in an unknown network with n nodes. We present the first protocol for any expander graph G with n nodes and minimum degree Θ(n) such that, the protocol informs every node in O(logn) rounds with high probability, and ..."
Abstract
 Add to MetaCart
, and uses O(lognloglogn) random bits in total. The runtime of our protocol is tight, and the randomness requirement of O(lognloglogn) random bits almost matches the lower bound of Ω(logn) random bits. We further study rumor spreading protocols for more general graphs, and for several graph topologies our
Quasirandom rumor spreading: An experimental analysis
 In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX
, 2009
"... We empirically analyze two versions of the wellknown “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. At SODA 2008, three of the authors proposed a quasirandom variant. Here, ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
We empirically analyze two versions of the wellknown “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. At SODA 2008, three of the authors proposed a quasirandom variant. Here
Rumors
 Journal of Finance
, 2003
"... University of Amsterdam for helpful comments. Last but not least, I thank the editor and an anonymous referee for their constructive feedback on earlier versions. RUMORS A dynamic model of a competitive securities market with private information diffusion is used to examine the motivation to spread ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
University of Amsterdam for helpful comments. Last but not least, I thank the editor and an anonymous referee for their constructive feedback on earlier versions. RUMORS A dynamic model of a competitive securities market with private information diffusion is used to examine the motivation to spread
On the Randomness Requirements of Rumor Spreading
, 2011
"... We investigate the randomness requirements of the classical rumor spreading problem on fully connected graphs with n vertices. In the standard random protocol, where each node that knows the rumor sends it to a randomly chosen neighbor in every round, each node needs O((log n) 2) random bits in orde ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We investigate the randomness requirements of the classical rumor spreading problem on fully connected graphs with n vertices. In the standard random protocol, where each node that knows the rumor sends it to a randomly chosen neighbor in every round, each node needs O((log n) 2) random bits
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
"... Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally well on many graphs and better for sparse random graphs. In this work we show three main results for the quasirandom rumor spreading ..."
Abstract

Cited by 28 (9 self)
 Add to MetaCart
Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally well on many graphs and better for sparse random graphs. In this work we show three main results for the quasirandom rumor
Rumor Spreading in Random Evolving Graphs ⋆
"... Abstract. In this paper, we aim at analyzing the classical information spreading Push protocol in dynamic networks. We consider the edgeMarkovian evolving graph model which captures natural temporal dependencies between the structure of the network at time t, and the one at time t + 1. Precisely, a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. In this paper, we aim at analyzing the classical information spreading Push protocol in dynamic networks. We consider the edgeMarkovian evolving graph model which captures natural temporal dependencies between the structure of the network at time t, and the one at time t + 1. Precisely
Results 1  10
of
96,696