118 citations · 440 across the 36 of their papers we have counts for
3 papers · 1 filter
Multiplex graph matching matched filters
Konstantinos Pantazis, Daniel L. Sussman, Youngser Park +3
We consider the problem of detecting a noisy induced multiplex template network in a larger multiplex background network. Our approach, which extends the framework of Sussman et al…
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…