Network alignment using self-returning walks

D. Cvetković, Irena M. Jovanović

We propose a new approach to the network alignment problem. We define the measure of similarity between vertices of considered networks using the numbers of self-returning walks at particular vertices. These numbers are related to graph invariants called graph angles which are known in spectral graph theory. We indicate advantages of our approach in comparison with existing procedures for network alignment.