Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Decomposition of the Laplacian on Metric Graphs (1901.00349v4)

Published 2 Jan 2019 in math.SP, math-ph, and math.MP

Abstract: We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to the structure of the graph. Such decompositions have been extremely useful in the study of Schr\"odinger operators on metric trees. We show that the tree structure is not essential, and moreover, obtain a direct and simple correspondence between such decompositions in the discrete and continuum case.

Summary

We haven't generated a summary for this paper yet.