Degree Matrix Comparison for Graph Alignment

The graph alignment problem, which considers the optimal node correspondence across networks, has recently gained significant attention due to its wide applications. There are various graph alignment methods, but we focus on the unsupervised geometric alignment algorithms. We propose Degree Matrix Comparison (DMC), a degree-based method that has shown to be effective for heterogeneous networks. Through extensive experiments and mathematical proofs, we demonstrate the potential of this method. Remarkably, DMC achieves up to 99% correct node alignment for 90%-overlap networks and 100% accuracy for isomorphic graphs. Additionally, we propose a reduced Greedy DMC with lower time complexity and Weighted DMC that has demonstrated potential for aligning weighted graphs. Positive results from applying Greedy DMC and the Weighted DMC furthermore speaks to the validity and potential of the DMC. The sequence of DMC methods could significantly impact graph alignment, offering reliable solutions for the task.