28 citations · 28 across the 2 of their papers we have counts for
3 papers · 1 filter
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…
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…