On the decomposition of the Laplacian on metric graphs
From MaRDI portal
Publication:2291625
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5317314 (Why is no real title available?)
- scientific article; zbMATH DE number 1125949 (Why is no real title available?)
- scientific article; zbMATH DE number 1542732 (Why is no real title available?)
- A Mourre estimate for a Schrödinger operator on a binary tree.
- A Survey on Spectra of infinite Graphs
- Absolutely continuous spectra of quantum tree graphs with weak disorder
- Anderson localization for radial tree-like random quantum graphs
- Anderson transition at two-dimensional growth rate on antitrees and spectral theory for operators with one propagating channel
- Can one hear the shape of a graph?
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Eigenvalue estimates for Schrödinger operators on metric trees
- Extended states in the Anderson model on the Bethe lattice
- GOE statistics for Anderson models on antitrees and thin boxes in \(\mathbb{Z}^3\) with deformed Laplacian
- Geometry of Sobolev spaces on regular trees and the Hardy inequalities
- Introduction to quantum graphs
- Localization criteria for Anderson models on locally finite graphs
- Localization for the Anderson model on trees with finite dimensions
- On stochastic completeness of jump processes
- On the spectrum of the Laplacian on regular metric trees
- Quantum Graphs and Their Applications
- Quantum graphs which optimize the spectral gap
- Quantum graphs: II. Some spectral properties of quantum and combinatorial graphs
- Remarks about Hardy inequalities on metric trees
- Singular continuous and dense point spectrum for sparse trees with finite dimensions
- Singular continuous spectrum for the Laplacian on certain sparse trees
- Singular spectrum for radial trees
- Spectral analysis of certain spherically homogeneous graphs
- Spectral estimates for infinite quantum graphs
- Stability of the absolutely continuous spectrum of random Schrödinger operators on tree graphs
- Stochastically Incomplete Manifolds and Graphs
- The absolutely continuous spectrum of Jacobi matrices
- Volume growth, spectrum and stochastic completeness of infinite graphs
Cited in
(13)- Localization for Anderson models on metric and discrete tree graphs
- Exact Hausdorff dimension of the spectral measure for the graph Laplacian on a sparse tree
- Isospectral graphs via inner symmetries
- Quantum graphs on radially symmetric antitrees
- Spectra of regular quantum trees: rogue eigenvalues and dependence on vertex condition
- On the spectrum of the Laplacian on regular metric trees
- Erratum to Spectral analysis of certain spherically homogeneous graphs, Operators and Matrices, 7 (2013), 825-847
- A note on the Gaffney Laplacian on infinite metric graphs
- Maximal quasi-accretive Laplacians on finite metric graphs
- Zero measure and singular continuous spectra for quantum graphs
- Metric decompositions of path-separable graphs
- Embedded trace operator for infinite metric trees
- Self‐adjoint and Markovian extensions of infinite quantum graphs
This page was built for publication: On the decomposition of the Laplacian on metric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291625)
