Can M. Le

According to our database, Can M. Le authored at least 12 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Determining the Number of Communities in Sparse and Imbalanced Settings.

Zhixuan Shao, Can M. Le

CoRR, 2024

2023

Variational Inference: Posterior Threshold Improves Network Clustering Accuracy in Sparse Regimes.

Xuezhen Li, Can M. Le

CoRR, 2023

2021

Edge Sampling Using Local Network Information.

Can M. Le

J. Mach. Learn. Res., 2021

Network Estimation by Mixing: Adaptivity and More.

Tianxi Li, Can M. Le

CoRR, 2021

2020

Comment: Ridge Regression and Regularization of Large Matrices.

Can M. Le, Keith D. Levin, Peter J. Bickel, Elizaveta Levina

Technometrics, 2020

2017

Concentration and regularization of random graphs.

Can M. Le, Elizaveta Levina, Roman Vershynin

Random Struct. Algorithms, 2017

Edge sampling using network local information.

Can M. Le

CoRR, 2017

Estimating a network from multiple noisy realizations.

Can M. Le, Elizaveta Levina

CoRR, 2017

2015

Concentration and regularization of random graphs.

Can M. Le, Roman Vershynin

CoRR, 2015

Sparse random graphs: regularization and concentration of the Laplacian.

Can M. Le, Elizaveta Levina, Roman Vershynin

CoRR, 2015

Estimating the number of communities in networks by spectral methods.

Can M. Le, Elizaveta Levina

CoRR, 2015

2014

Optimization via Low-rank Approximation, with Applications to Community Detection in Networks.

Can M. Le, Elizaveta Levina, Roman Vershynin

CoRR, 2014