Score: 0

Deep Identification of Propagation Trees

Published: March 1, 2025 | arXiv ID: 2503.00646v1

By: Zeeshan Memon , Chen Ling , Ruochen Kong and more

Potential Business Impact:

Maps how bad stuff spreads from person to person.

Business Areas:
Intrusion Detection Information Technology, Privacy and Security

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.

Country of Origin
🇺🇸 United States

Page Count
10 pages

Category
Computer Science:
Social and Information Networks