Graph Diffusion
Overview
Graph diffusion describes processes that spread signals, labels, or probability across connected nodes, and it underpins both graph learning and generation of graph-structured data. Methods include spectral heat kernels and random walks, neural diffusion operators such as personalized PageRank and sheaf-based propagation, and continuous or discrete denoising models such as score-based diffusion and DiGress-style methods. These approaches are used for node classification and clustering, molecular and network generation, forecasting on sensor graphs, and prediction on irregular physical meshes. A central tension is that stronger or longer-range propagation can capture useful global structure but also cause oversmoothing, while generative models must balance fidelity, sampling cost, structural constraints, and risks such as memorization.
Latest papers
75 papers14 papers in the last four weeks, against 2 the four weeks before. 0.1% of all new papers.