Abstract
Network alignment is a commonly encountered problem in many applications, where the objective is to match the nodes in different networks such that the incident edges of matched nodes are consistent. Gromov-Wasserstein (GW) distance, based on optimal transport, has been shown to be useful in assessing the topological (dis)similarity between two networks, as well as network alignment. In many practical applications of network alignment, there may be “seed” nodes with known matchings. However, GW distance assumes that no matchings are known. Here, we propose Generalized GW-based Network Alignment(GGWNA), with a loss/distance function that reflects the topological similarity of known matching nodes. We test the resulting framework using a large collection of real-world social networks. Our results show that, as compared to state-of-the-art network alignment algorithms, GGWNA can deliver more accurate alignment when the seed size is small. We also perform systematic simulation studies to characterize the performance of GGWNA as a function of seed size and noise, and find that GGWNA is more robust to noise as compared to competing algorithms. The implementation of GGWNA and the Supplementary Material can be found in https://github.com/Meng-zhen-Li/Generalized-GW.git.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE TPAMI 31(6), 1048–1058 (2009)
Chowdhury, S., Needham, T.: Generalized spectral clustering via gromov-wasserstein learning. In: ICAIS, pp. 712–720 (2021)
Flamary, R.: Pot: python optimal transport. JMLR 22(78), 1–8 (2021)
Halimi, A., Ayday, E.: Profile matching across online social networks. In: Meng, W., Gollmann, D., Jensen, C.D., Zhou, J. (eds.) ICICS 2020. LNCS, vol. 12282, pp. 54–70. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-61078-4_4
Heimann, M., Shen, H., Safavi, T., Koutra, D.: Regal: representation learning-based graph alignment. In: ACM CIKM, pp. 117–126 (2018)
Kazemi, E.: Proper: global protein interaction network alignment through percolation matching. BMCBbioinformatics 17(1), 1–16 (2016)
Leskovec, J.: Snap datasets: Ssanford large network dataset collection (2014)
Ma, L.: Heuristics and metaheuristics for biological network alignment: a review. Neurocomputing 491, 426–441 (2022)
Mémoli, F.: Gromov-wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11(4), 417–487 (2011)
Peyré, G., Cuturi, M., Solomon, J.: Gromov-wasserstein averaging of kernel and distance matrices. In: ICML, pp. 2664–2672 (2016)
Santambrogio, F.: Optimal transport for applied mathematicians. Birkäuser, NY 55(58–63), 94 (2015)
Shu, K., Wang, S., Tang, J., Zafarani, R., Liu, H.: User identity linkage across online social networks: a review. ACM SIGKDD Expl. 18(2), 5–17 (2017)
Titouan, V., Courty, N., Tavenard, R., Flamary, R.: Optimal transport for structured data with application on graphs. In: ICML, pp. 6275–6284 (2019)
Trung, H.T.: A comparative study on network alignment techniques. Expert Syst. Appl. 140, 112,883 (2020)
Vayer, T., Flamary, R., Tavenard, R., Chapel, L., Courty, N.: Sliced gromov-wasserstein. arXiv preprint arXiv:1905.10124 (2019)
Villani, C.: Topics in optimal transportation, vol. 58. AMS (2021)
Xu, H., Luo, D., Zha, H., Duke, L.C.: Gromov-wasserstein learning for graph matching and node embedding. In: ICML, pp. 6932–6941 (2019)
Zhang, S., Tong, H.: Final: Fast attributed network alignment. In: ACM SIGKDD, pp. 1345–1354 (2016)
Zhang, S., Tong, H., Jin, L., Xia, Y., Guo, Y.: Balancing consistency and disparity in network alignment. In: ACM SIGKDD, pp. 2212–2222 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, M., Koyutürk, M. (2024). Generalized Gromov Wasserstein Distance for Seed-Informed Network Alignment. In: Cherifi, H., Rocha, L.M., Cherifi, C., Donduran, M. (eds) Complex Networks & Their Applications XII. COMPLEX NETWORKS 2023. Studies in Computational Intelligence, vol 1143. Springer, Cham. https://doi.org/10.1007/978-3-031-53472-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-031-53472-0_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53471-3
Online ISBN: 978-3-031-53472-0
eBook Packages: EngineeringEngineering (R0)