SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
ACM SIGOPS Operating Systems Review
Discrete Applied Mathematics
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Diameter of a Scale-Free Random Graph
Combinatorica
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The cover time of the preferential attachment graph
Journal of Combinatorial Theory Series B
Adversarial Deletion in a Scale-Free Random Graph Process
Combinatorics, Probability and Computing
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
Rumor Spreading in Social Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On Mixing and Edge Expansion Properties in Randomized Broadcasting
Algorithmica - Special Issue: Algorithms and Computation; Guest Editor: Takeshi Tokuyama
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
Rumor spreading on random regular graphs and expanders
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Asymptotically optimal randomized rumor spreading
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ultra-fast rumor spreading in social networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Why rumors spread so quickly in social networks
Communications of the ACM
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The small community phenomenon in networks: models, algorithms and applications
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Membership(s) and compliance(s) with class-based graphs
Information Processing Letters
Asynchronous rumor spreading in preferential attachment graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The power of local information in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Randomised broadcasting: Memory vs. randomness
Theoretical Computer Science
| Hi-index | 0.02 |
With the prevalence of social networks, it has become increasingly important to understand their features and limitations. It has been observed that information spreads extremely fast in social networks. We study the performance of randomized rumor spreading protocols on graphs in the preferential attachment model. The well-known random phone call model of Karp et al. (FOCS 2000) is a push-pull strategy where in each round, each vertex chooses a random neighbor and exchanges information with it. We prove the following. - The push-pull strategy delivers a message to all nodes within Θ(log n) rounds with high probability. The best known bound so far was O(log2 n). - If we slightly modify the protocol so that contacts are chosen uniformly from all neighbors but the one contacted in the previous round, then this time reduces to Θ(log n / log log n), which is the diameter of the graph. This is the first time that a sublogarithmic broadcast time is proven for a natural setting. Also, this is the first time that avoiding double-contacts reduces the run-time to a smaller order of magnitude.