Efficient Estimation of Influence Functions for SIS Model on Social Networks
Abstract
We address the problem of efficiently estimating the influence function of initially activated nodes in a social network under the susceptible / infected / susceptible (SIS) model, a diffusion model where nodes are allowed to be activated multiple times. The computational complexity drastically increases because of this multiple activation property. We solve this problem by constructing a layered graph from the original social network with each layer added on top as the time proceeds, and applying the bond percolation with a pruning strategy. We show that the computational complexity of the proposed method is much smaller than the conventional naive probabilistic simulation method by a theoretical analysis and confirm this by applying the proposed method to two real world networks. Masahiro Kimura, Kazumi Saito, Hiroshi Motoda
Cite
Text
Kimura et al. "Efficient Estimation of Influence Functions for SIS Model on Social Networks." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Kimura et al. "Efficient Estimation of Influence Functions for SIS Model on Social Networks." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/kimura2009ijcai-efficient/)BibTeX
@inproceedings{kimura2009ijcai-efficient,
title = {{Efficient Estimation of Influence Functions for SIS Model on Social Networks}},
author = {Kimura, Masahiro and Saito, Kazumi and Motoda, Hiroshi},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {2046-2051},
url = {https://mlanthology.org/ijcai/2009/kimura2009ijcai-efficient/}
}