2010 IEEE International Conference on Data Mining 2010
DOI: 10.1109/icdm.2010.153
|View full text |Cite
|
Sign up to set email alerts
|

A Generalized Linear Threshold Model for Multiple Cascades

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
47
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 103 publications
(47 citation statements)
references
References 22 publications
0
47
0
Order By: Relevance
“…The diffusion of several contagions has been the focus of several recent works [10], [12], [18], [19], [23]. In each of these works, however, it is assumed that being infected with one contagion is mutually exclusive to be infected by another.…”
Section: Related Workmentioning
confidence: 99%
“…The diffusion of several contagions has been the focus of several recent works [10], [12], [18], [19], [23]. In each of these works, however, it is assumed that being infected with one contagion is mutually exclusive to be infected by another.…”
Section: Related Workmentioning
confidence: 99%
“…On the other hand, [5] proposes topic-aware extensions of LT model. In [60] the authors consider multiple cascades of LT model and they allow nodes to switch between them, whereas [10] introduces a number of modifications to the competing model variant: the authors force nodes to draw one cascade they join at the end of the process or consider the mutual influence of cascades on each other.…”
Section: Theorem 141 the Influence Maximization Problem Is Np-hard Fmentioning
confidence: 99%
“…Additionally, most existing work assumes only two concepts, while in reality there could be many interacting concepts. It is also often assumed that once activated a node remains active, though there are exceptions to this [17].…”
Section: Related Workmentioning
confidence: 99%