• Corpus ID: 16485998

# Breaking the log n barrier on rumor spreading

@article{Avin2015BreakingTL,
title={Breaking the log n barrier on rumor spreading},
author={C. Avin and Robert Els{\"a}sser},
journal={ArXiv},
year={2015},
volume={abs/1512.03022}
}
• Published 8 December 2015
• Computer Science
• ArXiv
$O(\log n)$ rounds has been a well known upper bound for rumor spreading using push&pull in the random phone call model (i.e., uniform gossip in the complete graph). A matching lower bound of $\Omega(\log n)$ is also known for this special case. Under the assumption of this model and with a natural addition that nodes can call a partner once they learn its address (e.g., its IP address) we present a new distributed, address-oblivious and robust algorithm that uses push&pull with pointer jumping…
2 Citations
• Computer Science
ArXiv
• 2018
In models that allow noiseless communication, a reduction of (a suitable variant of) Broadcast to binary Consensus is proved, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol.
• Computer Science
PODC
• 2020
Distributed plurality consensus among n nodes, each of which initially holds one of k opinions, is studied and it is shown that for a large range of initial configurations partial consensus can be reached significantly faster in this asynchronous communication model than in the synchronous setting.

## References

SHOWING 1-10 OF 36 REFERENCES

• Computer Science
DISC
• 2013
This work presents a new distributed, address-oblivious and robust algorithm that uses push&pull with pointer jumping to spread a rumor to all nodes in only $$O(\sqrt{\log n})$$ rounds, w.p.h.
The proof demonstrates that the number of persons informed after t stages obeys very closely, with high probability, a deterministic equation.
• Computer Science, Mathematics
ICALP
• 2009
This work exhibits a natural expansion property for networks which suffices to make quasirandom rumor spreading inform all nodes of the network in logarithmic time with high probability, and shows that if one of the push or pull model works well, so does the other.
• Computer Science
STOC '11
• 2011
This work studies the performance of randomized rumor spreading protocols on graphs in the preferential attachment model and proves the first time that a sublogarithmic broadcast time is proven for a natural setting.
• Computer Science
PODC '08
• 2008
If every node is allowed to choose four distinct neighbours instead of one, then the average number of message transmissions per node required to broadcast a message efficiently decreases exponentially and the algorithm efficiently handles limited communication failures, only requires rough estimates of the number of nodes, and is robust against limited changes in the size of the network.
• Computer Science
SODA '08
• 2008
A quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading") that achieves similar or better broadcasting times with a greatly reduced use of random bits.
It is shown that for any n-node graph with conductance, the classical PUSH-PULL algorithm distributes a rumor to all nodes of the graph in O( 1 logn) rounds with high probability (w.h.p.); this bound improves a recent result of Chierichetti, Lattanzi, and Panconesi [6].
• Computer Science
SODA
• 2012
Surprisingly, it is able to show that, if 2 < β < 3, the rumor spreads even in constant time, which is much smaller than the typical distance of two nodes, and the first result that establishes a gap between the synchronous and the asynchronous protocol.
Besides being the first efficient deterministic solution to the rumor spreading problem this algorithm is interesting in many aspects: It is simpler, more natural, more robust, and faster than its randomized pendant and guarantees success with certainty instead of with high probability.
• Computer Science
PODC '14
• 2014
A simple gossip algorithm which spreads a message in only O(log log n) rounds is given and it is shown that any gossip algorithm takes with high probability at least 0.99 log log n rounds to terminate.