Can M. Le

I am an assistant professor in the Department of Statistics at the University of California, Davis. I hold a Ph.D. in Statistics from the University of Michigan, Ann Arbor, where I was advised by Professor Elizaveta Levina and Professor Roman Vershynin.

My research interests include network analysis, random graph theory and high dimensional problems.

Preprints and Publications

C. M. Le and T. Li. Linear regression and its inference on noisy network-linked data. arXiv:2007.00803. Accepted to JRSSB, 2022.

C. M. Le and E Levina. Estimating the number of communities in networks by spectral methods. Electronic Journal of Statistics, 16(1) 3315-3342, 2022.

T. Li and C. M. Le. Network Estimation by Mixing: Adaptivity and More. arXiv:2106.02803, 2021. Submitted.

C. M. Le. Edge sampling using network local information. Journal of Machine Learning Research 22(88):1–29, 2021.

C. M. Le, E Levina and R. Vershynin. Concentration of random graphs and application to community detection. Proceedings of the International Congress of Mathematicians, Rio de Janeiro, 2018.

C. M. Le, K. Levin and E. Levina. Estimating a network from multiple noisy realizations. Electronic Journal of Statistics 12 (2), 4697-4740, 2018.

C. M. Le, Elizaveta Levina and Roman Vershynin. Concentration and regularization of random graphs. Random Structures & Algorithms 51 (3), 538-561, 2017.

C. M. Le, E Levina and R. Vershynin. Optimization via low-rank approximation for community detection in networks. The Annals of Statistics 44 (1), 373-400, 2016.

C. M. Le. On subspace-hypercyclic operators. Proceedings of the American Mathematical Society 139 (8), 2847-2852, 2011.

C. M. Le. Banach space of functions with the uniform Dini property Kharkov National University Vestnik. (828) 185-196, 2008.

C. M. Le, Elizaveta Levina and Roman Vershynin. Sparse random graphs: regularization and concentration of the Laplacian. arXiv:1502.03049, 2015. This manuscript was not published since it was superseded by our newer paper.