25 citations · 38 across the 5 of their papers we have counts for
4 papers · 1 filter
Ergodic Limits, Relaxations, and Geometric Properties of Random Walk Node Embeddings
Christy Lin, Daniel Sussman, Prakash Ishwar
Random walk based node embedding algorithms learn vector representations of nodes by optimizing an objective function of node embedding vectors and skip-bigram statistics computed…
Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks
Jesús Arroyo, Daniel L. Sussman, Carey E. Priebe +1
Given a pair of graphs with the same number of vertices, the inexact graph matching problem consists in finding a correspondence between the vertices of these graphs that minimizes…
Matched Filters for Noisy Induced Subgraph Detection
Daniel L. Sussman, Youngser Park, Carey E. Priebe +1
The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social n…
Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs
Daniel L. Sussman, Minh Tang, Carey E. Priebe
In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent po…