Graph Encoder Embedding

by   Cencheng Shen, et al.

In this paper we propose a lightning fast graph embedding method called graph encoder embedding. The proposed method has a linear computational complexity and the capacity to process billions of edges within minutes on standard PC – an unattainable feat for any existing graph embedding method. The speedup is achieved without sacrificing embedding performance: the encoder embedding performs as good as, and can be viewed as a transformation of the more costly spectral embedding. The encoder embedding is applicable to either adjacency matrix or graph Laplacian, and is theoretically sound, i.e., under stochastic block model or random dot product graph, the graph encoder embedding asymptotically converges to the block probability or latent positions, and is approximately normally distributed. We showcase three important applications: vertex classification, vertex clustering, and graph bootstrap; and the embedding performance is evaluated via a comprehensive set of synthetic and real data. In every case, the graph encoder embedding exhibits unrivalled computational advantages while delivering excellent numerical performance.


page 4

page 5

page 7

page 8


Synergistic Graph Fusion via Encoder Embedding

In this paper, we introduce a novel approach to multi-graph embedding ca...

Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection

In this paper we propose a novel and computationally efficient method to...

Spectral embedding of regularized block models

Spectral embedding is a popular technique for the representation of grap...

An Efficient JPEG Steganographic Scheme Design Using Domain Transformation of Embedding Cost

Although the recently proposed JPEG steganography using Block embedding ...

Discovering Communication Pattern Shifts in Large-Scale Networks using Encoder Embedding and Vertex Dynamics

The analysis of large-scale time-series network data, such as social med...

Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint

In this paper, we propose a scalable algorithm for spectral embedding. T...

Efficient Estimation for Random Dot Product Graphs via a One-step Procedure

We propose a one-step procedure to efficiently estimate the latent posit...

Please sign up or login with your details

Forgot password? Click here to reset