118 citations · 440 across the 36 of their papers we have counts for
4 papers · 1 filter
Spectral Clustering for Divide-and-Conquer Graph Matching
Vince Lyzinski, Daniel L. Sussman, Donniell E. Fishkind +5
We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with e…
Locality statistics for anomaly detection in time series of graphs
Heng Wang, Minh Tang, Youngser Park +1
The ability to detect change-points in a dynamic network or a time series of graphs is an increasingly important task in many applications of the emerging discipline of graph signa…
Out-of-sample Extension for Latent Position Graphs
Minh Tang, Youngser Park, Carey E. Priebe
We consider the problem of vertex classification for graphs constructed from the latent position model. It was shown previously that the approach of embedding the graphs into some…
On the Incommensurability Phenomenon
Donniell E. Fishkind, Cencheng Shen, Youngser Park +1
Suppose that two large, multi-dimensional data sets are each noisy measurements of the same underlying random process, and principle components analysis is performed separately on…