Estimating Vector Fields on Manifolds and the Embedding of Directed Graphs

This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field. This is the first generative model of its kind for directed graphs. We introduce a graph embedding algorithm that estimates all three features of this model: the low-dimensional embedding of the manifold, the data density and the vector field. In the process, we also obtain new theoretical results on the limits of "Laplacian type" matrices derived from directed graphs. The application of our method to both artificially constructed and real data highlights its strengths.

READ FULL TEXT
research
06/04/2020

Embedding Directed Graphs in Potential Fields Using FastMap-D

Embedding undirected graphs in a Euclidean space has many computational ...
research
05/24/2019

Statistical embedding for directed graphs

We propose a novel statistical node embedding of directed graphs, which ...
research
12/15/2021

Fast Computation of Generalized Eigenvectors for Manifold Graph Embedding

Our goal is to efficiently compute low-dimensional latent coordinates fo...
research
06/16/2021

Directed Graph Embeddings in Pseudo-Riemannian Manifolds

The inductive biases of graph representation learning algorithms are oft...
research
09/27/2020

A Weighted Quiver Kernel using Functor Homology

In this paper, we propose a new homological method to study weighted dir...
research
01/24/2020

A continuum limit for the PageRank algorithm

Semi-supervised and unsupervised machine learning methods often rely on ...
research
11/11/2019

Poincare Hopf for vector fields on graphs

We generalize the Poincare-Hopf theorem sum_v i(v) = X(G) to vector fiel...

Please sign up or login with your details

Forgot password? Click here to reset