Reconstructing Graph Diffusion History from a Single Snapshot
Not on the map. Why?
Abstract (arXiv)
Diffusion on graphs is ubiquitous with numerous high-impact applications. In these applications, complete diffusion histories play an essential role in terms of identifying dynamical patterns, reflecting on precaution actions, and forecasting intervention effects. Despite their importance, complete diffusion histories are rarely available and are highly challenging to reconstruct due to ill-posedness, explosive search space, and scarcity of training data. To date, few methods exist for diffusion history reconstruction. They are exclusively based on the maximum likelihood estimation (MLE) formulation and require to know true diffusion parameters. In this paper, we study an even harder problem, namely reconstructing Diffusion history from A single SnapsHot} (DASH), where we seek to reconstruct the history from only the final snapshot without knowing true diffusion parameters. We start with theoretical analyses that reveal a fundamental limitation of the MLE formulation. We prove: (a) estimation error of diffusion parameters is unavoidable due to NP-hardness of diffusion parameter estimation, and (b) the MLE formulation is sensitive to estimation error of diffusion parameters. To overcome the inherent limitation of the MLE formulation, we propose a novel barycenter formulation: finding the barycenter of the posterior distribution of histories, which is provably stable against the estimation error of diffusion parameters. We further develop an effective solver named DIffusion hiTting Times with Optimal proposal (DITTO) by reducing the problem to estimating posterior expected hitting times via the Metropolis--Hastings Markov chain Monte Carlo method (M--H MCMC) and employing an unsupervised graph neural network to learn an optimal proposal to accelerate the convergence of M--H MCMC. We conduct extensive experiments to demonstrate the efficacy of the proposed method.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 22 of its 100 references that are in the map. First posted on arXiv 1 Jun 2023.
Builds on
22 of 100 references.
References · 22
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
- 2019Diffusion Improves Graph Learningcited by 414
- 2018BRITS: Bidirectional Recurrent Imputation for Time Seriescited by 288
- 2021GRAND: Graph Neural Diffusioncited by 258
- 2022DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problemscited by 127
- 2021Filling the G_ap_s: Multivariate Time Series Imputation by Graph Neural Networkscited by 93
- 2022Learning to Reconstruct Missing Data from Spatiotemporal Graphs with Sparse Observationscited by 64
- 2021Dissecting the Diffusion Process in Linear Graph Convolutional Networkscited by 58
- 2021Network of Tensor Time Seriescited by 32
10 more
- 2022Optimization-Induced Graph Implicit Nonlinear Diffusioncited by 28
- 2022Source Localization of Graph Diffusion via Variational Autoencoders for Graph Inverse Problemscited by 18
- 2016Catch'Em All: Locating Multiple Diffusion Sources in Networks with Partial Observationscited by 16
- 2022An Invertible Graph Diffusion Neural Network for Source Localizationcited by 14
- 2013Trace Complexity of Network Inferencecited by 8
- 2021Diffusion Source Identification on Networks with Statistical Confidencecited by 5
- 2015Back to the Past: Source Identification in Diffusion Networks from Partially Observed Cascadescited by 2
- 2017Collaborative Inference of Coexisting Information Diffusionscited by 2
- 2015Kinetics of Social Contagioncited by 1
- 2016Network Infusion to Infer Information Sources in Networkscited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 5; 2025: 5; 2026: 2.
13 papers.
Sort:
By area:
- 2024Discrete-state Continuous-time Diffusion for Graph Generationcited by 73
- 2024How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmarkcited by 39
- 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesicscited by 17
- 2024Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimizationcited by 12
- 2025Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecastingcited by 12
- 2024Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptationcited by 10
- 2024Ask, and it shall be given: On the Turing completeness of promptingcited by 10
- 2025PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignmentcited by 10
- 2023Fine-grained Graph Rationalizationcited by 1
- 2025Saffron-1: Safety Inference Scalingcited by 1
- 2025Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphscited by 1
- 2026Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learningcited by 1
- 2026Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation18 Jun 2026
- 2026Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning6 Feb 2026
- 2025Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphs16 Sep 2025
- 2025Saffron-1: Safety Inference Scaling6 Jun 2025
- 2025PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignment27 May 2025
- 2025Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting24 May 2025
- 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics19 May 2025
- 2024Ask, and it shall be given: On the Turing completeness of prompting4 Nov 2024
- 2024Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptation9 Oct 2024
- 2024How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark10 Jun 2024
- 2024Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization27 May 2024
- 2024Discrete-state Continuous-time Diffusion for Graph Generation19 May 2024
1 more
- 2023Fine-grained Graph Rationalization13 Dec 2023
- 2025Saffron-1: Safety Inference Scalingcited by 1
- 2025Saffron-1: Safety Inference Scaling6 Jun 2025
- 2024How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmarkcited by 39
- 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesicscited by 17
- 2024Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimizationcited by 12
- 2025Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecastingcited by 12
- 2024Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptationcited by 10
- 2024Ask, and it shall be given: On the Turing completeness of promptingcited by 10
- 2025PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignmentcited by 10
- 2023Fine-grained Graph Rationalizationcited by 1
- 2025Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphscited by 1
- 2026Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learningcited by 1
- 2026Structuring and Tokenizing Distributed User Interest Context for Generative Recommendationcited by 0
- 2026Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation18 Jun 2026
- 2026Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning6 Feb 2026
- 2025Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphs16 Sep 2025
- 2025PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignment27 May 2025
- 2025Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting24 May 2025
- 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics19 May 2025
- 2024Ask, and it shall be given: On the Turing completeness of prompting4 Nov 2024
- 2024Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptation9 Oct 2024
- 2024How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark10 Jun 2024
- 2024Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization27 May 2024
- 2023Fine-grained Graph Rationalization13 Dec 2023