SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Randomized broadcast in networks
SIGAL '90 Proceedings of the international symposium on Algorithms
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
The cover time of sparse random graphs.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Sampling regular graphs and a peer-to-peer network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Simulating a Random Walk with Constant Error
Combinatorics, Probability and Computing
Deterministic random walks on the integers
European Journal of Combinatorics
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic random walks on regular trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic random walks on the two-dimensional grid
Combinatorics, Probability and Computing
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Theoretical Computer Science
Rumor Spreading in Social Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Strong Robustness of Randomized Rumor Spreading Protocols
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
On the bit communication complexity of randomized rumor spreading
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Quasirandom evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Spreading of messages in random graphs
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Communication complexity of quasirandom rumor spreading
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Quasi-random rumor spreading: Reducing randomness can be costly
Information Processing Letters
Messy broadcasting - Decentralized broadcast schemes with limited knowledge
Discrete Applied Mathematics
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading
SIAM Journal on Discrete Mathematics
Rumor spreading in social networks
Theoretical Computer Science
Order optimal information spreading using algebraic gossip
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Sharp bounds by probability-generating functions and variable drift
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Quasirandom rumor spreading: An experimental analysis
Journal of Experimental Algorithmics (JEA)
Asymptotically optimal randomized rumor spreading
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Fast simulation of large-scale growth models
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
SIAM Journal on Discrete Mathematics
Randomised broadcasting: memory vs. randomness
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the randomness requirements of rumor spreading
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Parallel rotor walks on finite graphs and applications in discrete load balancing
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Direction-reversing quasi-random rumor spreading with restarts
Information Processing Letters
Randomised broadcasting: Memory vs. randomness
Theoretical Computer Science
Hi-index | 0.00 |
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. 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 Struct. Algorithms 1990). In the quasirandom model, we assume that each node has a (cyclic) list of its neighbors. Once informed, it starts at a random position of the list, but from then on informs its neighbors in the order of the list. Surprisingly, irrespective of the orders of the lists, the above mentioned bounds still hold. In addition, we also show a O(log n) bound for sparsely connected random graphs G(n, p) with p = (log n + f(n))/n, where f(n) → ∞ and f(n) = O(log log n). Here, the classical model needs Θ(log2(n)) rounds. Hence the quasirandom model achieves similar or better broadcasting times with a greatly reduced use of random bits.