Consider a 4-regular graph with $N^2$ vertices, which can be interpreted as a $N\times N$ lattice with periodic boundary conditions so that every vertex has degree 4.
For an unweighted and undirected graph, the Laplacian matrix can be written as $\mathbf{L}=4\mathbf{I}-\mathbf{A}$. Where $\mathbf{I}$ is the identity matrix and $\mathbf{A}$ is the adjacency matrix. In that case the eigenvalues are known and are equal to: \begin{equation} \lambda_{N(j-1)+k}=4-2 \cos \left(\frac{2 \pi j}{N}\right)-2 \cos \left(\frac{2 \pi k}{N}\right) \end{equation} for $1 \leq j,k \leq N$.
The smallest eigenvalue will be $\lambda_{N^2}=0$. And the Laplacian is a singular matrix.
In the case of adding a regulator $s$ on one of the elements of the diagonal, such that $L_{ii}=4+s\delta_{ia}-A_{ii}$, $\mathbf{L}$ becomes invertible and its smallest eigenvalue $\lambda_{N^2}>0$.
I noticed numerically that for $s\gg1$ the smallest eigenvalue seems to reach a limit that scales with some function of $N$.
How could I derive an expression for the smallest eigenvalue, or at least determine how it scales with $N$?
Edit: Using perturbation theory, for large $s$ I could show that the smallest eigenvalue of $\mathbf{L}$ tends to the smallest eigenvalue of the matrix $\tilde{\mathbf{L}}$ of size $(N-1)\times (N-1)$ where we removed the $a^\text{th}$ column and row of $\mathbf{L}$. Now the question boils down to: what is the smallest eigenvalue of $\tilde{\mathbf{L}}$?