Given a $d$-regular graph $G=(V,E)$ with $|V| =n$. We know that the smallest eigenvalue of the normalized laplacian matrix of $G$ is $0$. I have seen the formulation of the second smallest eigenvalue $\lambda_2$ in terms of the rayleigh quotient. However, the below paper mentions it in a way which I am not aware of.
How to derive the below (or similar) formulation of $\lambda_2$? Or am I horribly wrong in my interpretation?
$\lambda_2 = \min\limits_{\overline{v} \in \mathbb{R}^n, ||\overline{v}||=1} \dfrac{\mathbb{E}_{(u,v) \in E} ||\overline{u}-\overline{v}||^2}{\mathbb{E}_{u,v \in V} ||\overline{u}-\overline{v}||^2}$
Source : Proof of Theorem 7.1 (Section 7) of https://arxiv.org/pdf/1205.2234.pdf