SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Diameter of a Scale-Free Random Graph
Combinatorica
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Adversarial deletion in a scale free random graph process
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The cover time of the preferential attachment graph
Journal of Combinatorial Theory Series B
The diameter of sparse random graphs
Random Structures & Algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
Rumour spreading and graph conductance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
A rule-based policy language for selective trust propagation in social networks
Databases and Social Networks
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
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Randomized information dissemination in dynamic environments
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc and mobile networking. Rumor spreading is one of the basic mechanisms for information dissemination in networks, its relevance stemming from its simplicity of implementation and effectiveness. In this paper, we study the performance of rumor spreading in the classic preferential attachment model of Bollobás et al. which is considered to be a valuable model for social networks. We prove that, in these networks: (a) The standard PUSH-PULL strategy delivers the message to all nodes within O (log2 n ) rounds with high probability; (b) by themselves, PUSH and PULL require polynomially many rounds. (These results are under the assumption that m , the number of new links added with each new node is at least 2. If m = 1 the graph is disconnected with high probability, so no rumor spreading strategy can work.) Our analysis is based on a careful study of some new properties of preferential attachment graphs which could be of independent interest.