We propose a novel method for comparing non-aligned graphs of different\nsizes, based on the Wasserstein distance between graph signal distributions\ninduced by the respective graph Laplacian matrices. Specifically, we cast a new\nformulation for the one-to-many graph alignment problem, which aims at matching\na node in the smaller graph with one or more nodes in the larger graph. By\nintegrating optimal transport in our graph comparison framework, we generate\nboth a structurally-meaningful graph distance, and a …