Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining knowledge-sharing sites for viral marketing
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Toward an interoperable dynamic network analysis toolkit
Decision Support Systems
Hi-index | 0.00 |
Diffusion is a process by which information, viruses, ideas and new behavior spread over social networks. The traditional independent cascade model gives activated nodes a one-time chance to activate each of its neighboring nodes with some probability. This paper extends the traditional cascade model to be history dependent. We propose a new model called the History Sensitive Cascade Model (HSCM) that allows activated nodes to receive more than a one-time chance to activate their neighbors. HSCM provides 1) a polynomial algorithm for calculating the probability of activity for any arbitrary node at any arbitrary time in tree structure graphs, and 2) a Markov model for calculating the probability in general graphs. Finally, we perform an empirical study on HSCM under different network settings. These simulations have showed its power to observe and explain the emergent phenomena in the macro level when changing parameters in the micro level.