Scalable Influence Estimation in Continuous-Time Diffusion Networks

Abstract

If a piece of information is released from a media site, can it spread, in 1 month, to a million web pages? This influence estimation problem is very challenging since both the time-sensitive nature of the problem and the issue of scalability need to be addressed simultaneously. In this paper, we propose a randomized algorithm for influence estimation in continuous-time diffusion networks. Our algorithm can estimate the influence of every node in a network with |V| nodes and |E| edges to an accuracy of $\epsilon$ using $n=O(1/{\epsilon }^2)$ randomizations and up to logarithmic factors O(n|E|+n|V|) computations. When used as a subroutine in a greedy influence maximization algorithm, our proposed method is guaranteed to find a set of nodes with an influence of at least (1-1/e)OPT-2$\epsilon$, where OPT is the optimal value. Experiments on both synthetic and real-world data show that the proposed method can easily scale up to networks of millions of nodes while significantly improves over previous state-of-the-arts in terms of the accuracy of the estimated influence and the quality of the selected nodes in maximizing the influence.

To appear in Advances in Neural Information Processing Systems (NIPS), 2013

References in corpus (1)

• Modeling Information Propagation with Survival Theory

Cited by in corpus (8)

• Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
• Adaptive Influence Maximization in Dynamic Social Networks
• Optimal Deployment of Resources for Maximizing Impact in Spreading Processes
• Graph Kernels: State-of-the-Art and Future Challenges
• Universal Components of Real-world Diffusion Dynamics based on Point Processes
• Birdspotter: A Tool for Analyzing and Labeling Twitter Users
• Causal Inference for Influence Propagation -- Identifiability of the Independent Cascade Model
• Fake News Detection in Social Networks via Crowd Signals