On Concentration Inequality of the Laplacian Matrix of Erdős-Rényi Graphs

This paper focuses on the concentration properties of the spectral norm of the normalized Laplacian matrix for Erdős-Rényi random graphs. First, We achieve the optimal bound that can be attained in the further question posed by Le et al. [24] for the regularized Laplacian matrix. Beyond that, we also establish a uniform concentration inequality for the spectral norm of the Laplacian matrix in the homogeneous case, relying on a key tool: the uniform concentration property of degrees, which may be of independent interest. Additionally, we prove that after normalizing the eigenvector corresponding to the largest eigenvalue, the spectral norm of the Laplacian matrix concentrates around 1, which may be useful in special cases.