23 citations · 100 across the 27 of their papers we have counts for
5 papers · 2 filters
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…
On a 'Two Truths' Phenomenon in Spectral Graph Clustering
Carey E. Priebe, Youngser Park, Joshua T. Vogelstein +6
Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering - clustering the vertices of a graph based o…
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…
Out-of-sample extension of graph adjacency spectral embedding
Keith Levin, Farbod Roosta-Khorasani, Michael W. Mahoney +1
Many popular dimensionality reduction procedures have out-of-sample extensions, which allow a practitioner to apply a learned embedding to observations not seen in the initial trai…
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
Jordan Yoder, Li Chen, Henry Pao +5
Suppose that one particular block in a stochastic block model is of interest, but block labels are only observed for a few of the vertices in the network. Utilizing a graph realize…