@inproceedings{6b8214cb7b6441faaae78f1bc1f80bca,
title = "Asynchronous rumor spreading in preferential attachment graphs",
abstract = "We show that the asynchronous push-pull protocol spreads rumors in preferential attachment graphs (as defined by Barab{\'a}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).",
author = "Benjamin Doerr and Mahmoud Fouz and Tobias Friedrich",
year = "2012",
month = jul,
day = "4",
doi = "10.1007/978-3-642-31155-0\_27",
language = "English",
isbn = "9783642311543",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "307--315",
booktitle = "Algorithm Theory, SWAT 2012 - 13th Scandinavian Symposium and Workshops, Proceedings",
note = "13th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012 ; Conference date: 04-07-2012 Through 06-07-2012",
}