2014
NIPS
NeurIPS 2014
Tight Bounds for Influence in Diffusion Networks and Application to Bond Percolation and Epidemiology
Abstract
In this paper, we derive theoretical bounds for the long-term influence of a node in an Independent Cascade Model (ICM). We relate these bounds to the spectral radius of a particular matrix and show that the behavior is sub-critical when this spectral radius is lower than 1. More specifically, we point out that, in general networks, the sub-critical regime behaves in O(sqrt(n)) where n is the size of the network, and that this upper bound is met for star-shaped networks. We apply our results to epidemiology and percolation on arbitrary networks, and derive a bound for the critical value beyond which a giant connected component arises. Finally, we show empirically the tightness of our bounds for a large family of networks.
🌉
Interdisciplinary Bridge
— Data Science & Analytics and Mathematics & Optimization
🧭
Keyword Pioneer
— spectral radius
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Reinforcement Learning
📈
Trend Setter
— Disease Surveillance
Authors
Topics
Data Science & Analytics > Applications > Disease Surveillance
Mathematics & Optimization > Mathematics > Graph Theory
Mathematics & Optimization > Mathematics > Probability
Mathematics & Optimization > Optimization > Stochastic Methods
Mathematics & Optimization > Optimization > Theory
Machine Learning > Learning Types > Statistical Learning