DeepAI AI Chat
Log In Sign Up

Spectral embedding and the latent geometry of multipartite networks

by   Alexander Modell, et al.

Spectral embedding finds vector representations of the nodes of a network, based on the eigenvectors of its adjacency or Laplacian matrix, and has found applications throughout the sciences. Many such networks are multipartite, meaning their nodes can be divided into partitions and nodes of the same partition are never connected. When the network is multipartite, this paper demonstrates that the node representations obtained via spectral embedding live near partition-specific low-dimensional subspaces of a higher-dimensional ambient space. For this reason we propose a follow-on step after spectral embedding, to recover node representations in their intrinsic rather than ambient dimension, proving uniform consistency under a low-rank, inhomogeneous random graph model. Our method naturally generalizes bipartite spectral embedding, in which node representations are obtained by singular value decomposition of the biadjacency or bi-Laplacian matrix.


page 1

page 2

page 3

page 4


Geometric Laplacian Eigenmap Embedding

Graph embedding seeks to build a low-dimensional representation of a gra...

On spectral embedding performance and elucidating network structure in stochastic block model graphs

Statistical inference on graphs often proceeds via spectral methods invo...

Network Together: Node Classification via Cross-Network Deep Network Embedding

Network embedding is a highly effective method to learn low-dimensional ...

Manifold structure in graph embeddings

Statistical analysis of a graph often starts with embedding, the process...

Spectral Network Embedding: A Fast and Scalable Method via Sparsity

Network embedding aims to learn low-dimensional representations of nodes...

Spectral embedding for dynamic networks with stability guarantees

We consider the problem of embedding a dynamic network, to obtain time-e...

Weighted Spectral Embedding of Graphs

We present a novel spectral embedding of graphs that incorporates weight...