Minimizing the seed set cost for influence spreading with the probabilistic guarantee

作者：

Highlights：

• The problem of minimum seed cost with probabilistic influence spreading is defined.

• An algorithm is presented to calculate the probability for activating the nodes.

• A method is proposed for estimating the influence propagation by path counting.

• An algorithm is presented for the problem, and the error of its result is analyzed.

摘要

•The problem of minimum seed cost with probabilistic influence spreading is defined.•An algorithm is presented to calculate the probability for activating the nodes.•A method is proposed for estimating the influence propagation by path counting.•An algorithm is presented for the problem, and the error of its result is analyzed.

论文关键词：Cost minimization,Seed set,Influence spreading,Linear threshold (LT) model,Sampling graph

论文评审过程：Received 27 February 2020, Revised 17 January 2021, Accepted 19 January 2021, Available online 22 January 2021, Version of Record 8 February 2021.

论文官网地址：https://doi.org/10.1016/j.knosys.2021.106797