Abstract: Random matrix theory has played an important role in recent work on statistical network analysis. In this talk, I will review recent results on regimes of concentration of random graphs around their expectation, showing that dense graphs concentrate, and sparse graphs concentrate after regularization. I will also discuss some new results and open problems regarding spectra of random graphs, with applications to the problem of community detection.