5 citations · 9 across the 6 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2022
Adversarial contamination of networks in the setting of vertex nomination: a new trimming method
Sheyda Peyman, Minh Tang, Vince Lyzinski
As graph data becomes more ubiquitous, the need for robust inferential graph algorithms to operate in these complex data domains is crucial. In many cases of interest, inference is…
stat.ML2016★ 5 cited
Limit theorems for eigenvectors of the normalized Laplacian for random graphs
Minh Tang, Carey E. Priebe
We prove a central limit theorem for the components of the eigenvectors corresponding to the largest eigenvalues of the normalized Laplacian matrix of a finite dimensional rand…