118 citations · 252 across the 14 of their papers we have counts for
3 papers · 2 filters
Vertex nomination schemes for membership prediction
D. E. Fishkind, V. Lyzinski, H. Pao +2
Suppose that a graph is realized from a stochastic block model where one of the blocks is of interest, but many or all of the vertices' block labels are unobserved. The task is to…
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…
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…