118 citations · 291 across the 26 of their papers we have counts for
5 papers · 1 filter
Shuffled total least squares
Qian Wang, Daniel Sussman
Linear regression with shuffled labels and with a noisy latent design matrix arises in many correspondence recovery problems. We propose a total least-squares approach to the probl…
Bias-Variance Tradeoffs in Joint Spectral Embeddings
Benjamin Draves, Daniel L. Sussman
Joint spectral embeddings facilitate analysis of multiple network data by simultaneously mapping vertices in each network to points in Euclidean space where statistical inference i…
Matchability of heterogeneous networks pairs
Vince Lyzinski, Daniel L. Sussman
We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability can b…
A nonparametric two-sample hypothesis testing problem for random dot product graphs
Minh Tang, Avanti Athreya, Daniel L. Sussman +2
We consider the problem of testing whether two finite-dimensional random dot product graphs have generating latent positions that are independently drawn from the same distribution…
A central limit theorem for scaled eigenvectors of random dot product graphs
Avanti Athreya, Vince Lyzinski, David J. Marchette +3
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions…