23 citations · 23 across the 6 of their papers we have counts for
5 papers · 1 filter
Vertex Nomination, Consistent Estimation, and Adversarial Modification
Joshua Agterberg, Youngser Park, Jonathan Larson +3
Given a pair of graphs and and a vertex set of interest in , the vertex nomination (VN) problem seeks to find the corresponding vertices of interest in (if t…
Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering
Congyuan Yang, Carey E. Priebe, Youngser Park +1
Our problem of interest is to cluster vertices of a graph by identifying underlying community structure. Among various vertex clustering approaches, spectral clustering is one of t…
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…
Semiparametric spectral modeling of the Drosophila connectome
Carey E. Priebe, Youngser Park, Minh Tang +8
We present semiparametric spectral modeling of the complete larval Drosophila mushroom body connectome. Motivated by a thorough exploratory data analysis of the network via Gaussia…