Asynchronous Rumor Spreading in Preferential Attachment Graphs

DOI10.1007/978-3-642-31155-0_27MaRDI QIDQ2904566zbMATH OpenOpenAlexFDO

Authors Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich

Publication date 14 August 2012

Published in Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.1969

Mathematics Subject Classification ID

Network protocols (68M12) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
• Randomized Rumor Spreading in Dynamic Graphs
• Rumor spreading in random evolving graphs
• Rumor spreading in random evolving graphs
• Asymptotically optimal randomized rumor spreading
• Asymptotically optimal randomized rumor spreading
• Rumour spreading and graph conductance
• Rumor propagation with heterogeneous transmission in social networks

Cited in

(13)

• On linear-time data dissemination in dynamic rooted trees
• Stochastic analysis of rumor spreading with multiple pull operations
• Faster rumor spreading with multiple calls
• On the Push\&Pull protocol for rumour spreading (extended abstract)
• Randomized rumor spreading in poorly connected small-world networks
• Rumor spreading with no dependence on conductance
• Rumor Spreading in Social Networks
• On the Push&Pull Protocol for Rumor Spreading
• How asynchrony affects rumor spreading time
• Rumor spreading in social networks
• Social networks spread rumors in sublogarithmic time
• Ultra-fast rumor spreading in social networks
• Continuous-time stochastic analysis of rumor spreading with multiple operations

This page was built for publication: Asynchronous Rumor Spreading in Preferential Attachment Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904566)