In this paper, we introduce a method called graph fusion embedding, designed for multi-graph embedding with shared vertex sets. Under the framework of supervised learning, our method exhibits a remarkable and highly desirable synergistic effect: for sufficiently large vertex size, the accuracy of vertex classification consistently benefits from the incorporation of additional graphs. We establish the mathematical foundation for the method, including the asymptotic convergence of the embedding, a sufficient condition for asymptotic optimal classification, and the proof of the synergistic effect for vertex classification. Our comprehensive simulations and real data experiments provide compelling evidence supporting the effectiveness of our proposed method, showcasing the pronounced synergistic effect for multiple graphs from disparate sources.
@article{arxiv.2303.18051,
title = {Synergistic Graph Fusion via Encoder Embedding},
author = {Cencheng Shen and Carey E. Priebe and Jonathan Larson and Ha Trinh},
journal= {arXiv preprint arXiv:2303.18051},
year = {2024}
}