118 citations · 438 across the 49 of their papers we have counts for
5 papers · 1 filter
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Vince Lyzinski, Keith Levin, Donniell E. Fishkind +1
Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a con…
Numerical tolerance for spectral decompositions of random matrices
Avanti Athreya, Michael Kane, Bryan Lewis +5
We precisely quantify the impact of statistical error in the quality of a numerical approximation to a random matrix eigendecomposition, and under mild conditions, we use this to i…
Information Recovery in Shuffled Graphs via Graph Matching
Vince Lyzinski
While many multiple graph inference methodologies operate under the implicit assumption that an explicit vertex correspondence is known across the vertex sets of the graphs, in pra…
Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements
Keith Levin, Vince Lyzinski
Manifold learning and dimensionality reduction techniques are ubiquitous in science and engineering, but can be computationally expensive procedures when applied to large data sets…
Semi-External Memory Sparse Matrix Multiplication for Billion-Node Graphs
Da Zheng, Disa Mhembere, Vince Lyzinski +3
Sparse matrix multiplication is traditionally performed in memory and scales to large matrices using the distributed memory of multiple nodes. In contrast, we scale sparse matrix m…