Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications
This episode discusses a paper by James Hyun and François G. Meyer that provides a unified mathematical framework for comparing networks using optimal transport. The hosts explore how shifting 'mass' between nodes quantifies network differences, the use of the Sinkhorn algorithm for efficiency, and new spectral bounds to distinguish isospectral graphs.