38 citations · 38 across the 2 of their papers we have counts for
3 papers
stat.ME2024
Determining the Number of Communities in Sparse and Imbalanced Settings
Zhixuan Shao, Can M. Le
Community structures represent a crucial aspect of network analysis, and various methods have been developed to identify these communities. However, a common hurdle lies in determi…
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…
stat.ML2014
Optimization via Low-rank Approximation for Community Detection in Networks
Can M. Le, Elizaveta Levina, Roman Vershynin
Community detection is one of the fundamental problems of network analysis, for which a number of methods have been proposed. Most model-based or criteria-based methods have to sol…