Breaking the $$\log n$$ log n barrier on rumor spreading


$$O(\log n)$$ 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 $$\varOmega (\log n)$$ Ω ( log n ) is also known for this special case. Under the assumption of this model and with a natural addition that nodes can… (More)
DOI: 10.1007/s00446-017-0312-4


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.