Spectral convergence of the discrete Laplacian on models of a metrized graph

From MaRDI portal
(Redirected from Publication:851541)



Abstract: A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become uniformly distributed on the metrized graph, then the i-th largest eigenvalue of the Laplacian matrices of these combinatorial graphs converges to the i-th largest eigenvalue of the continuous Laplacian operator on the metrized graph upon suitable scaling. The eigenvectors of these matrices can be viewed as functions on the metrized graph by linear interpolation. These interpolated functions form a normal family, any convergent subsequence of which limits to an eigenfunction of the continuous Laplacian operator on the metrized graph.


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.











This page was built for publication: Spectral convergence of the discrete Laplacian on models of a metrized graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851541)