As part of my Numerical Analysis course, I explored the relationship between Erdős–Rényi random graphs and Laplacian eigenvalues. Namely, I demonstrated how we can obtain the second-smallest eigenvalue (known as the algebraic connectivity) using the Lanczos algorithm to efficiently determine whether or not a randomly generated graph is connected.

Check out the slides here.