|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
24 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Metrized graphs, electrical networks, and Fourier analysis | | Matthew Baker
; Xander Faber
; | | Date: |
25 Jul 2004 | | Subject: | Combinatorics; Classical Analysis and ODEs | math.CO math.CA | | Abstract: | 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. | | Source: | arXiv, math.CO/0407428 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER