New relations between discrete and continuous transition operators on (metric) graphs
Abstract
We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each other using explicit expressions. In particular, we show that the averaging operator is closely related with the solutions of the associated wave equation. The machinery used allows one to study a class of infinite graphs without assumption on the local finiteness.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.