We study the dihedral multi-reference alignment problem of estimating orbit a signal from multiple noisy observations signal, acted on by random elements group. show that if group are drawn generic distribution, is uniquely determined second moment observations. This implies optimal estimation rate in high noise regime proportional to square variance noise. first result this type for over non-a...

A novel method for comparing non-aligned graphs of various sizes is proposed, based on the Wasserstein distance between graph signal distributions induced by respective Laplacian matrices. Specifically, a new formulation one-to-many alignment problem casted, which aims at matching node in smaller with one or more nodes larger graph. By incorporating optimal transport into our comparison framewo...