arXiv:2606. 27455v1 Announce Type: cross Abstract: We address the problem of inferring a directed network from nodal measurements generated by linear diffusion dynamics on the sought graph.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
arXiv:2606. 00758v1 Announce Type: cross Abstract: In recent years, graph signal processing has emerged as a powerful framework at the intersection of signal processing and graph theory, providing tools for the analysis of signals defined on nodes while accounting for their relationships represented by edges.
Denoising graphs is a fundamental problem in graph learning and the core operation of graph diffusion models. Attention-based architectures like graph transformers have recently shown promise in denoising graphs.
arXiv:2607. 06546v1 Announce Type: cross Abstract: Denoising graphs is a fundamental problem in graph learning and the core operation of graph diffusion models.
The paper introduces Ricci-Diffusion, a graph denoising technique that uses curvature-guided diffusion inspired by Ricci flow. Unlike traditional similarity-driven methods, it modulates local transport in the diffusion kernel based on edge-level curvature, steering edge-weight updates toward a more regular graph geometry. The authors provide theoretical analysis showing curvature’s ability to distinguish graph structures and induce first-order corrections, and demonstrate that the method converges to a stable denoised network, improving structure recovery and downstream performance on real-world and synthetic graphs.
arXiv:2511. 11927v2 Announce Type: replace-cross Abstract: Principal Component Analysis (PCA) is a standard tool for extracting a low-rank signal from noisy observations.
arXiv:2507.23559v2 Announce Type: replace-cross Abstract: Certain data are naturally modeled by networks or weighted graphs, be they biological networks or mobility networks. When there is no canonic...