118 citations · 1.3k across the 129 of their papers we have counts for
7 papers · 2 filters
Universally consistent vertex classification for latent positions graphs
Minh Tang, Daniel L. Sussman, Carey E. Priebe
In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate feature maps for latent position graphs with positive definite link f…
Statistical inference on errorfully observed graphs
Carey E. Priebe, Daniel L. Sussman, Minh Tang +1
Statistical inference on graphs is a burgeoning field in the applied and theoretical statistics communities, as well as throughout the wider world of science, engineering, business…
Anomaly Detection in Time Series of Graphs using Fusion of Graph Invariants
Youngser Park, Carey E. Priebe, Abdou Youssef
Given a time series of graphs G(t) = (V, E(t)), t = 1, 2, ..., where the fixed vertex set V represents "actors" and an edge between vertex u and vertex v at time t (uv \in E(t)) re…
Generalized Canonical Correlation Analysis for Disparate Data Fusion
Ming Sun, Carey E. Priebe, Minh Tang
Manifold matching works to identify embeddings of multiple disparate data spaces into the same low-dimensional space, where joint inference can be pursued. It is an enabling method…
Seeded Graph Matching
Donniell E. Fishkind, Sancar Adali, Heather G. Patsolic +4
Given two graphs, the graph matching problem is to align the two vertex sets so as to minimize the number of adjacency disagreements between the two graphs. The seeded graph matchi…
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…