46 citations · 89 across the 6 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
stat.ML2015★ 46 cited
Estimating the number of communities in networks by spectral methods
Can M. Le, Elizaveta Levina
Community detection is a fundamental problem in network analysis with many methods available to estimate communities. Most of these methods assume that the number of communities is…
math.PR2015
Concentration and regularization of random graphs
Can M. Le, Elizaveta Levina, Roman Vershynin
This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the…
math.ST2015★ 38 cited
Sparse random graphs: regularization and concentration of the Laplacian
Can M. Le, Elizaveta Levina, Roman Vershynin
We study random graphs with possibly different edge probabilities in the challenging sparse regime of bounded expected degrees. Unlike in the dense case, neither the graph adjacenc…