Influence prediction for continuous-time information propagation on networks

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

We consider the problem of predicting the time evolution of influence, defined by the expected number of activated (infected) nodes, given a set of initially activated nodes on a propagation network. To address the significant computational challenges of this problem on large heterogeneous networks, we establish a system of differential equations governing the dynamics of probability mass functions on the state graph where each node lumps a number of activation states of the network, which can be considered as an analogue to the Fokker-Planck equation in continuous space. We provides several methods to estimate the system parameters which depend on the identities of the initially active nodes, the network topology, and the activation rates etc. The influence is then estimated by the solution of such a system of differential equations. Dependency of the prediction error on the parameter estimation is established. This approach gives rise to a class of novel and scalable algorithms that work effectively for large-scale and dense networks. Numerical results are provided to show the very promising performance in terms of prediction accuracy and computational efficiency of this approach.

Cite

CITATION STYLE

APA

Chow, S. N., Ye, X., Zha, H., & Zhou, H. (2018). Influence prediction for continuous-time information propagation on networks. Networks and Heterogeneous Media, 13(4), 567–583. https://doi.org/10.3934/nhm.2018026

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free