Linh V. Tran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Linh V. Tran has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Christopher Hoffman
Department of Mathematics, University of Washington, Seattle, USA
1 shared publication - Gerandy Brito1 shared publication
- Ioana Dumitriu
Mathematics University of Washington
1 shared publication - Shirshendu Ganguly
University of Washington
1 shared publication
Latest Publications
- Open Access
Recovery and Rigidity in a Regular Stochastic Block Model
The stochastic block model is a natural model for studying community detection in random networks. Its clustering properties have been extensively studied in the statistics, physics and computer science literature. Recently this area has experienced major mathematical breakthroughs, particularly for the binary (two-community) version, see Mossel, Neeman, Sly (2012, 2013) and Massoulie (2013). In this paper, we introduce a variant of the binary model which we call the regular stochastic block model (RSBM). We prove rigidity by showing that with high probability an exact recovery of the community structure is possible. Spectral methods exhibit a regime where this can be done efficiently. Moreover we also prove that, in this setting, any suitably good partial recovery can be bootstrapped to obtain a full recovery of the communities.
Open AccessRecovery and Rigidity in a Regular Stochastic Block Model
The stochastic block model is a natural model for studying community detection in random networks. Its clustering properties have been extensively studied in the statistics, physics and computer science literature. Recently this area has experienced major mathematical breakthroughs, particularly for the binary (two-community) version, see Mossel, Neeman, Sly (2012, 2013) and Massoulie (2013). In this paper, we introduce a variant of the binary model which we call the regular stochastic block model (RSBM). We prove rigidity by showing that with high probability an exact recovery of the community structure is possible. Spectral methods exhibit a regime where this can be done efficiently. Moreover we also prove that, in this setting, any suitably good partial recovery can be bootstrapped to obtain a full recovery of the communities.
- 5 April 2019
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 43 (2) , 1517-1526
Local Law for Eigenvalues of Random Regular Bipartite Graphs
- 5 April 2019
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 43 (2) , 1517-1526
Local Law for Eigenvalues of Random Regular Bipartite Graphs