A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs
Performing statistical inference on collections of graphs is of import to many disciplines. Graph embedding, in which the vertices of a graph are mapped to vectors in a low-dimensional Euclidean space, has gained traction as a basic tool for graph analysis. Here we describe an omnibus embedding in which multiple graphs on the same vertex set are jointly embedded into a single space with a distinct representation for each graph. We prove a central limit theorem for this omnibus embedding and show that simultaneous embedding into a common space allows comparison of graphs without the need to perform pairwise alignments of graph embeddings. Experimental results demonstrate that the omnibus embedding improves upon existing methods. (Please note: per the D3M workshop organizers' request, this is an extended abstract of a paper that has already been posted to arXiv at https://arxiv.org/abs/1705.09355)