Metrized graphs, electrical networks, and Fourier analysis
| dc.creator | Baker, Matthew | |
| dc.creator | Faber, Xander | |
| dc.date | 2004-07-25 | |
| dc.date | 2005-07-01 | |
| dc.date.accessioned | 2026-07-07T05:10:40Z | |
| dc.date.available | 2026-07-07T05:10:40Z | |
| dc.description | A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'', the effective resistance, and eigenfunctions of the Laplacian. We discuss the relationship between metrized graphs and electrical networks, which provides some physical intuition for the concepts being dealt with. We also discuss the relation between the Laplacian on a metrized graph and the combinatorial Laplacian matrix. We introduce the``canonical measure'' on a metrized graph, which arises naturally when considering the Laplacian of the effective resistance function. Finally, we discuss a generalization of classical Fourier analysis which utilizes eigenfunctions of the Laplacian on a metrized graph. During the course of the paper, we obtain a proof of Foster's network theorem and of an intriguing series identity. | |
| dc.description | 23 pages, 5 figures; corrected minor typos and altered tone slightly, updated exercises 3 and 13, updated references | |
| dc.identifier | https://arxiv.org/abs/math/0407428 | |
| dc.identifier | http://arxiv.org/abs/math/0407428 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71997 | |
| dc.subject | Combinatorics | |
| dc.subject | Classical Analysis and ODEs | |
| dc.title | Metrized graphs, electrical networks, and Fourier analysis | |
| dc.type | text |