Deep Identification of Propagation Trees
By: Zeeshan Memon , Chen Ling , Ruochen Kong and more
Potential Business Impact:
Maps how bad stuff spreads from person to person.
Understanding propagation structures in graph diffusion processes, such as epidemic spread or misinformation diffusion, is a fundamental yet challenging problem. While existing methods primarily focus on source localization, they cannot reconstruct the underlying propagation trees i.e., "who infected whom", which are substantial for tracking the propagation pathways and investigate diffusion mechanisms. In this work, we propose Deep Identification of Propagation Trees (DIPT), a probabilistic framework that infers propagation trees from observed diffused states. DIPT models local influence strengths between nodes and leverages an alternating optimization strategy to jointly learn the diffusion mechanism and reconstruct the propagation structure. Extensive experiments on five real-world datasets demonstrate the effectiveness of DIPT in accurately reconstructing propagation trees.
Similar Papers
Graph Discovery and Source Detection in Temporal Graphs
Data Structures and Algorithms
Finds where and when infections start spreading.
Deep learning framework for predicting stochastic take-off and die-out of early spreading
Social and Information Networks
Predicts if a sickness will spread widely early.
Learning hidden cascades via classification
Social and Information Networks
Find hidden sickness spreaders in groups.