Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators

This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model the observed graph as a sample from a manifold endowed with a vector