Asynchronous Rumor Spreading in Preferential Attachment Graphs
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 307-315
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Rumor spreading in social networksTheoretical Computer Science, 2011
- Almost tight bounds for rumour spreading with conductance2010
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness2009
- Randomized gossip algorithmsIEEE Transactions on Information Theory, 2006
- The Diameter of a Scale-Free Random GraphCombinatorica, 2004
- The Average Distance in a Random Graph with Given Expected DegreesInternet Mathematics, 2004
- The degree sequence of a scale‐free random graph processRandom Structures & Algorithms, 2001
- Emergence of Scaling in Random NetworksScience, 1999
- On Richardson's Model on the Hypercube1997
- Epidemic algorithms for replicated database maintenanceACM SIGOPS Operating Systems Review, 1988