arXiv subjects

Iman Seyedi

Publications and source records attributed to Iman Seyedi.

3 recordsLinked to original sources

arXiv2026

Diffusion enabled Optimal Transport distances for graph matching

This paper introduces Diffusion Semi-Relaxed Fused Gromov-Wasserstein (DsrFGW), a novel method for graph comparison that unifies node features and structural connectivity through optimal transport. While traditional Gromov-Wasserstein and semi-relaxed variants (srGW, srFGW) capture graph structure, they often struggle with sparse, noisy, or partially observed graphs. Inspired by Graph Diffusion Distance, which posits graphs are similar if they enable similar information transmission patterns, DsrFGW incorporates diffusion processes allowing information propagation across nodes, capturing local and global structural patterns while reducing sensitivity to noise or missing edges. An extensive evaluation on 36 synthetic pairwise graph matching tasks (easy, medium, hard) demonstrates consistent superiority over srFGW, achieving accuracy improvements of 0-20 percentage points and dramatic Adjusted Rand Index (ARI) gains: in medium-difficulty scenarios, srFGW often achieves negative ARI (worse than random) while DsrFGW offers better performance in terms of both internal and external clustering quality measures (i.e., Adjusted Rank Index and Accuracy with respect to the true underlying clusters, respectively). Even under severe noise, DsrFGW improves clustering quality in 92% of the synthetic tasks with optimal diffusion scales adapting to problem difficulty, establishing DsrFGW as a robust framework for graph comparison under structural uncertainty.

cs.LG↗

arXiv2025

Structural Vulnerability Assessment in Urban Transport Networks: A Network-Wide Geometric Approach Using Gromov-Wasserstein

Urban transportation networks are inherently vulnerable to disruptions that affect connectivity and passenger mobility. Traditional graph_theoretic metrics, such as betweenness and degree centrality, offer insights into local network structure but often fail to capture global structural distortions resulting from link failures. On the other hand, global indices, such as those based on spectral analysis of the networks graph, fail in identifying critical elements. This study proposes to quantify the structural modifications implied by the disruption of single elements in a transportation network through the Gromov-Wasserstein distance. Specifically, we iteratively remove one single edge from the original network to simulate a disruptive event and then compute the Gromov-Wasserstein distance between the original network and the disrupted one. Finally, edges are ranked depending on the observed Gromov-Wasserstein distance: the higher the value of the distance, the more critical the edge is in terms. Two transportation networks from Berlin are considered in the experiments, namely Berlin Friedrichshain Center (BFC) and Berlin Tiergarten (BT). Results reveal that Gromov-Wasserstein is largely uncorrelated with edge betweenness (rho<0.1), proving its ability to capture vulnerability aspects overlooked by local network measures. Moreover, Gromov-Wasserstein exhibits an almost perfect correlation (rho=0.9999) against a proxy measure of the transportation service level, that is, the increase in the maximum shortest path. As a result, the Gromov-Wasserstein distance can be used to rank edges depending on their criticality with respect to their individual impact on the overall infrastructure and level, allowing for prioritizing maintenance, emergency planning, and enhancing the resilience of the urban transport network.

physics.soc-ph↗

arXiv2025

Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric

The assignment problem, a cornerstone of operations research, seeks an optimal one-to-one mapping between agents and tasks to minimize total cost. This work traces its evolution from classical formulations and algorithms to modern optimal transport (OT) theory, positioning the Quadratic Assignment Problem (QAP) and related structural matching tasks within this framework. We connect the linear assignment problem to Monge's transport problem, Kantorovich's relaxation, and Wasserstein distances, then extend to cases where source and target lie in different metric-measure spaces requiring Gromov-Wasserstein (GW) distances. GW formulations, including the fused GW variant that integrates structural and feature information, naturally address QAP-like problems by optimizing alignment based on both intra-domain distances and cross-domain attributes. Applications include graph matching, keypoint correspondence, and feature-based assignments. We present exact solvers, Genetic Algorithms (GA), and multiple GW variants, including a proposed multi-initialization strategy (GW-MultiInit) that mitigates the risk of getting stuck in local optima alongside entropic Sinkhorn-based approximations and fused GW. Computational experiments on capacitated QAP instances show that GW-MultiInit consistently achieves near-optimal solutions and scales efficiently to large problems where exact methods become impractical, while parameterized EGW and FGW variants provide flexible trade-offs between accuracy and runtime. Our findings provide theoretical foundations, computational insights, and practical guidelines for applying OT and GW methods to QAP and other real-world matching problems, such as those in machine learning and logistics.

math.OC↗