Abstract
We show that the asynchronous push-pull protocol spreads rumors in preferential attachment graphs (as defined by Barabási and Albert) in time to all but a lower order fraction of the nodes with high probability. This is significantly faster than what synchronized protocols can achieve; an obvious lower bound for these is the average distance, which is known to be Θ(logn/loglogn). © 2012 Springer-Verlag.
Cite
CITATION STYLE
Doerr, B., Fouz, M., & Friedrich, T. (2012). Asynchronous rumor spreading in preferential attachment graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7357 LNCS, pp. 307–315). https://doi.org/10.1007/978-3-642-31155-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
