Spectral convergence of the discrete Laplacian on models of a metrized graph (Q851541)

A metrized graph can be modeled by a family of weighted combinatorial graphs where a number of points on the metrized graph are designated as vertices. On each of these models, one has a Laplacian matrix acting on functions defined on the vertices, while on the metrized graph there is a measure-valued Laplacian operator. The author proves in this paper that the eigenvalues and eigenvectors of the combinatorial weighted Laplacian matrix on the model converge, when suitably scaled, to the eigenvalues and eigenfunctions of the Laplacian operator on the metrized graph.