The spectrum of the averaging operator on a network (metric graph)

zbMATH Open1152.47004arXivmath/0509595MaRDI QIDQ938620FDOQ938620

Authors: Donald I. Cartwright, Wolfgang Woess 

Publication date: 26 August 2008

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

Abstract: A network is a countable, connected graph X viewed as a one-complex, where each edge [x,y]=[y,x] (x,y in X^0, the vertex set) is a copy of the unit interval within the graph's one-skeleton X^1 and is assigned a positive conductance c(xy). A reference "Lebesgue" measure on X^1 is built up by using Lebesgue measure with total mass c(xy) on each edge [x,y]. There are three natural operators on X : the transition operator P acting on functions on X^0 (the reversible Markov chain associated with the conductances), the averaging operator A over spheres of radius 1 on X^1, and the Laplace operator on X^1 (with Kirchhoff conditions weighted by c(.) at the vertices). The relation between the l^2-spectrum of P and the H^2-spectrum of the Laplacian was described by Cattaneo (Mh. Math. 124, 1997). In this paper we describe the relation between the l^2-spectrum of P and the L^2-spectrum of A.

Full work available at URL: https://arxiv.org/abs/math/0509595

Recommendations

• The spectrum of the averaging operator for a finite homogeneous graph
• On the spectrum of the averaging operator for a finite homogeneous graph
• On the spectrum of the normalized graph Laplacian
• On the spectral density function of the Laplacian of a graph
• Spectral analysis of metric graphs and related spaces
• On the Laplacian spectral ratio of connected graphs
• The Laplacian spectra of graphs and complex networks
• scientific article; zbMATH DE number 867649
• On the spectrum of the Laplace operator of metric graphs attached at a vertex—spectral determinant approach
• Spectral analysis for adjacency operators on graphs

zbMATH Keywords

networkLaplace operatorspectral radiusaveraging operatormetric graphquantum graphspectrumconductancesreversible Markov chain

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Spectrum, resolvent (47A10)

Cited In (6)

• Sobolev type inequalities for compact metric graphs
• New relations between discrete and continuous transition operators on (metric) graphs
• Unitary dimension reduction for a class of self-adjoint extensions with applications to graph-like structures
• Spectra of Schrödinger operators on equilateral quantum graphs
• An example of unitary equivalence between self-adjoint extensions and their parameters
• Dynamical systems associated with adjacency matrices

This page was built for publication: The spectrum of the averaging operator on a network (metric graph)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q938620)