Papers
Topics
Authors
Recent
2000 character limit reached

Modeling Information Propagation with Survival Theory (1305.3616v1)

Published 15 May 2013 in cs.SI, cs.DS, physics.soc-ph, and stat.ML

Abstract: Networks provide a skeleton for the spread of contagions, like, information, ideas, behaviors and diseases. Many times networks over which contagions diffuse are unobserved and need to be inferred. Here we apply survival theory to develop general additive and multiplicative risk models under which the network inference problems can be solved efficiently by exploiting their convexity. Our additive risk model generalizes several existing network inference models. We show all these models are particular cases of our more general model. Our multiplicative model allows for modeling scenarios in which a node can either increase or decrease the risk of activation of another node, in contrast with previous approaches, which consider only positive risk increments. We evaluate the performance of our network inference algorithms on large synthetic and real cascade datasets, and show that our models are able to predict the length and duration of cascades in real data.

Citations (176)

Summary

An Analytical Framework for Information Propagation and Network Inference

The paper "Modeling Information Propagation with Survival Theory" presents a robust theoretical framework that leverages survival theory to model information propagation across networks and infer unobserved network structures. The authors introduce both additive and multiplicative risk models as mechanisms to understand the diffusion of contagions, such as information, ideas, or diseases, across social networks. This approach is characterized by its ability to efficiently solve network inference problems due to the convex nature of the models.

Methodology and Key Findings

The authors propose two models: the additive risk model and the multiplicative risk model. The additive risk model generalizes existing network inference frameworks, highlighting that many recent methods are specific instances of this broader model. This model captures scenarios where the infection risk of a node increases due to the infection of its neighbors, leading to efficient inference through convex optimization. In contrast, the multiplicative risk model provides insight into situations where interactions between nodes may either increase or decrease the risk of propagation. Both models offer a novel perspective, facilitating predictions about cascade length and duration with validated performance on synthetic and real cascade datasets.

Strong Numerical Results and Implications

The paper evaluates the performance of its models using comprehensive experiments on synthetic network scenarios and real-world datasets. The experimental results demonstrate the efficacy of these models in accurately predicting the size and duration of information cascades. For example, the multiplicative risk model shows a notable capacity to model complex interactions, indicating its potential utility in practical scenarios where behavior may not uniformly increase infection risks. Moreover, the inclusion of L1-norm regularization within the multiplicative model enhances sparsity, addressing the tendency for dense networks resulting from straightforward multiplicative formulations.

Theoretical and Practical Implications

The primary theoretical contribution of the paper lies in its demonstration of how survival theory can ground network inference in a probabilistically rigorous framework. By extending existing models of network diffusion, the authors enrich the modeling toolkit available for analyzing dynamic networks. Practically, the insights gathered from this paper can inform the design of strategies for curbing misinformation spread or optimizing content distribution across media networks. Furthermore, by formulating network inference as a convex optimization problem, the authors provide a path toward scalable solutions applicable to vast network datasets.

Future Directions

Potential avenues for future work include expanding the models to accommodate external influences that are endogenous to the network and exploring nonparametric approaches to baselines within the multiplicative model. Incorporating dynamic parameters could inform the paper of evolving networks, enabling analysis that accounts for temporal changes. Lastly, development of goodness-of-fit tests would offer a refined approach to model validation, guiding the selection process for network modeling tasks.

Overall, this paper contributes a comprehensive and analytically grounded approach to understanding information propagation in networks, offering valuable insights and methodologies for researchers in the field of network science and AI.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.