Spectral Convergence of the Discrete Laplacian on Models of a Metrized Graph

Details Spectral Convergence of the Discrete Laplacian on Models of a Metrized Graph Spectral Convergence of the Discrete Laplacian on Models of a Metrized Graph

2005-02-16

arxiv.org/abs/math/0502347v2

Mathematics

Classical Analysis and ODEs

25 pages; URL at the end of section 2 corrected; reformatted drastically; added new references; new introduction with example

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Spectral Convergence of the Discrete Laplacian on Models of a Metrized Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spectral Convergence of the Discrete Laplacian on Models of a Metrized Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral Convergence of the Discrete Laplacian on Models of a Metrized Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84136