A Generalized Linear Threshold Model for Multiple Cascades

Authors:
Nishith Pathak;Arindam Banerjee;Jaideep Srivastava
Affiliations:
-;-;-
Venue:
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Year:
2010

Citing 0
Cited 6

Winner takes all: competing viruses or ideas on fair-play networks

Proceedings of the 21st international conference on World Wide Web
Interacting viruses in networks: can both survive?

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Understanding and managing cascades on large graphs

Proceedings of the VLDB Endowment
Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships

Proceedings of the sixth ACM international conference on Web search and data mining
The bang for the buck: fair competitive viral marketing from the host perspective

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Hierarchical influence maximization for advertising in multi-agent markets

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a generalized version of the linear threshold model for simulating multiple cascades on a network while allowing nodes to switch between them. The proposed model is shown to be a rapidly mixing Markov chain and the corresponding steady state distribution is used to estimate highly likely states of the cascades' spread in the network. Results on a variety of real world networks demonstrate the high quality of the estimated solution.