ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Graph diffusion networks”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGstat.MLRecentJun 3, 2026

Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning

Meher Chaitanya, My Le, Luana Ruiz

The paper introduces Graph Cascades, a mesoscopic rewiring technique that enhances Graph Neural Networks by promoting node pairs with strong multi-hop connections to direct edges, improving performanc…

View →
stat.MLcs.CYcs.LGEmpiricalRecentJun 16, 2026

Geometrical fairness in graph neural networks

Arturo Pérez-Peralta, Sandra Benítez-Peña, Blas Kolic, Rosa E. Lillo

This paper proposes a fairness-aware adaptation of graph-based diffusion methods by modifying the Laplacian operator to mitigate bias-related components.

View →
math.OCcs.CCcs.DMRecentMay 29, 2026

Diffusion-Robust Optimization over Graphs

Liviu Aolaritei, Ricky Huang, Michael I. Jordan, Paul Grigas

The paper introduces a diffusion-based uncertainty model for robust optimization on graphs, showing that the resulting computational complexity depends critically on the interaction between the uncert…

View →
stat.MLcs.AIcs.LGTheoreticalRecentJul 8, 2026

DiPhon: Diffusion on Graphons for Scalable Graph Generation

Sergio Rozada, Yiming Qin, Manuel Madeira, Pascal Frossard +1 more

This paper introduces DiPhon, a diffusion framework for size-scalable graph generation, using a continuous diffusion process on the graphon space and a discretized graph-level process.

View →
cs.LGcs.AIEmpiricalRecentJul 7, 2026

Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion

Shervin Khalafi, Igor Krawczuk, Sergio Rozada, Charilaos Kanatsoulis +2 more

This paper introduces Spectral Attention and Graph Convolutional Attention (GCA) for denoising graphs, which outperforms linear attention and provably utilizes the input graph spectrum.

View →
stat.MLcs.LGcs.SITheoreticalRecentJun 25, 2026

Directed Graph Topology Inference via Graph Filter Identification

Rasoul Shafipour, Andrei Buciulea, Santiago Segarra, Antonio G. Marques +1 more

This paper addresses the problem of inferring a directed network from nodal measurements using graph convolutional filters and identifies the diffusion filter and network topology.

View →
cs.LGmath.STstat.MERecentJun 1, 2026

Network Learning with Semi-relaxed Gromov-Wasserstein

Charles Dufour, Ulysse Naepels, Leonardo V. Santoro

The paper proposes a semi-relaxed Gromov-Wasserstein objective to estimate the latent connectivity structure of large-scale networks, achieving statistically consistent and efficient recovery of the u…

View →
cs.LGcs.AIRecentMay 29, 2026

Scaling Higher-Order Graph Learning with Maximal Clique Complexes

Antoine Vialle, Aref Einizade, Fragkiskos D. Malliaros, Jhony H. Giraldo

This paper proposes a scalable topological learning framework for higher-order graph representation by introducing simplified and factored cellular Weisfeiler Leman tests and a novel random walk metho…

View →
cs.LGcs.AIRecentMay 27, 2026

Evolutionary Refinement of Generative Graph Topologies: A Hybrid WGAN-GA Approach

James Sargant, Seyedeh Ava Razi Razavi, Renata Dividino, Sheridan Houghten

The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.

View →
cs.AIRecentMay 29, 2026

Generating Graph-like Rules for Knowledge Graph Reasoning via Diffusion Models

Haoxiang Cheng, Yunfei Wang, Chao Chen, Kewei Cheng +4 more

The paper proposes GRiD, a novel framework that uses a two-phase training strategy (supervised pre-training and RL fine-tuning) to discover complex, graph-like rules for knowledge graph reasoning, ove…

View →
cs.CVEmpiricalRecentJul 16, 2026

DAPGNet: Dynamic Adaptive Physics-Guided Graph Diffusion Network for Hyperspectral Image Classification

Pengkun Wang, Weijia Cao, Ning Wang, Xiaofei Yang

This paper proposes DAPGNet, a dynamic adaptive physics-guided graph diffusion network for hyperspectral image classification, which achieves state-of-the-art performance on four datasets.

View →
cs.LGcs.AIcs.DCTheoreticalRecentJul 3, 2026

Decentralised Federated Learning over Temporal Networks: The Role of Heterogeneities

Arash Badie-Modiri, Chiara Boldrini, Lorenzo Valerio, János Kertész +1 more

This paper investigates the effects of structural and temporal inhomogeneities in decentralised federated learning and shows that they significantly slow down the convergence process.

View →
cs.IRcs.AIEmpiricalRecentJun 18, 2026

Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation

Ruizhong Qiu, Yinglong Xia, Dongqi Fu, Hanqing Zeng +5 more

This paper proposes G2Rec, a scalable framework for industrial-scale generative recommendation that unifies graph-based user co-engagement modeling and semantic tokenization.

View →
cs.CLcs.AIRecentMay 29, 2026

What Gets Unmasked First? Trajectory Analysis of Diffusion Models for Graph-to-Text Generation

Qing Wang, Jacob Devasier, Chengkai Li

This paper analyzes the decoding process of masked diffusion models for graph-to-text generation, finding that structural fine-tuning disrupts natural entity-first generation and proposing a structura…

View →
math.STcs.LGmath.PRTheoreticalRecentJul 18, 2026

The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy

Aseem Raj Baranwal

This paper studies the depth required for a graph neural network on a sparse graph using the contextual stochastic block model, and proves that the error is governed by the Kesten-Stigum ratio.

View →
cs.LGcs.AIRecentMay 28, 2026

Graph-Conditioned Mixture of Graph Neural Network Experts for Traffic Forecasting

Amirhossein Ghaffari, Saeid Sheikhi, Ekaterina Gilman

The paper proposes GC-MoE, a graph-conditioned Mixture of Experts framework, to improve traffic forecasting by assigning personalized, specialized forecasting experts to individual road segments.

View →
cs.DCcs.DSEmpiricalRecentJul 22, 2026

Fully Dynamic Rooted Spanning Tree on GPU

Abhijeet Sahu, Harmit Singh, Soham Nandy, G. Ramakrishna

This paper presents four novel parallel algorithms for maintaining a rooted spanning forest in dynamic graphs, achieving a throughput of 2 million insertions and 1.4 million deletions per second.

View →
cs.LGcs.AIcs.CRRecentApr 21, 2026

When Graph Structure Becomes a Liability: A Critical Re-Evaluation of Graph Neural Networks for Bitcoin Fraud Detection under Temporal Distribution Shift

Saket Maganti

This paper critically re-evaluates the use of Graph Neural Networks (GNNs) for Bitcoin fraud detection, demonstrating that under strict, leakage-free temporal evaluation, simple feature-only models si…

View →