activity
20212025
collaborators

8 papers

cs.SI2025

dyGRASS: Dynamic Spectral Graph Sparsification via Localized Random Walks on GPUs

Yihang Yuan, Ali Aghdaei, Zhuo Feng

This work presents dyGRASS, an efficient dynamic algorithm for spectral sparsification of large undirected graphs that undergo streaming edge insertions and deletions. At its core,…

cs.SI2024

SHyPar: A Spectral Coarsening Approach to Hypergraph Partitioning

Hamed Sajadinia, Ali Aghdaei, Zhuo Feng

State-of-the-art hypergraph partitioners utilize a multilevel paradigm to construct progressively coarser hypergraphs across multiple layers, guiding cut refinements at each level…

cs.LG2024

SGM-PINN: Sampling Graphical Models for Faster Training of Physics-Informed Neural Networks

John Anticev, Ali Aghdaei, Wuxinlin Cheng +1

SGM-PINN is a graph-based importance sampling framework to improve the training efficacy of Physics-Informed Neural Networks (PINNs) on parameterized problems. By applying a graph…

cs.LG2024

A Spectral Framework for Evaluating Geodesic Distances Between Graphs

Soumen Sikder Shuvo, Ali Aghdaei, Zhuo Feng

This paper presents a spectral framework for quantifying the differentiation between graph data samples by introducing a novel metric named Graph Geodesic Distance (GGD). For two d…

cs.DS2024

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition

Ali Aghdaei, Zhuo Feng

This work presents inGRASS, a novel algorithm designed for incremental spectral sparsification of large undirected graphs. The proposed inGRASS algorithm is highly scalable and par…

cs.LG2024

SAGMAN: Stability Analysis of Graph Neural Networks on the Manifolds

Wuxinlin Cheng, Chenhui Deng, Ali Aghdaei +2

Modern graph neural networks (GNNs) can be sensitive to changes in the input graph structure and node features, potentially resulting in unpredictable behavior and degraded perform…

cs.LG2022

HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering

Ali Aghdaei, Zhuo Feng

This paper introduces a scalable algorithmic framework (HyperEF) for spectral coarsening (decomposition) of large-scale hypergraphs by exploiting hyperedge effective resistances. M…

cs.LG2021

HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering

Ali Aghdaei, Zhiqiang Zhao, Zhuo Feng

Hypergraphs allow modeling problems with multi-way high-order relationships. However, the computational cost of most existing hypergraph-based algorithms can be heavily dependent u…