Asynchronous Rumor Spreading on Random Graphs
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 424-434
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Ultra-Fast Rumor Spreading in Social Networks2012
- Asynchronous Rumor Spreading in Preferential Attachment Graphs2012
- Almost tight bounds for rumour spreading with conductance2010
- Rumour spreading and graph conductance2010
- Gossip-based peer samplingACM Transactions on Computer Systems, 2007
- The cover time of sparse random graphsRandom Structures & Algorithms, 2006
- The Average Distance in a Random Graph with Given Expected DegreesInternet Mathematics, 2004
- A Gossip-Style Failure Detection Service1998
- On Spreading a RumorSIAM Journal on Applied Mathematics, 1987
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985