2014
DOI: 10.1090/s0002-9947-2014-06432-5
|View full text |Cite
|
Sign up to set email alerts
|

Non-self-adjoint graphs

Abstract: On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity transforms to self-adjoint Laplacians. Among other things, we describe a simple way how to relate the similarity transforms between Laplacians on certain graphs with elementary similarity transforms between matrices defining the boundary conditions. * On a leave from b.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
35
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 34 publications
(35 citation statements)
references
References 41 publications
0
35
0
Order By: Relevance
“…The existence of such a process is in fact elementary and it can be constructed by piecing together Brownian motions in a rather direct way. The problem (1.1) can be also understood as a spectral problem for a non-self-adjoint graph with regular boundary conditions [9].…”
Section: Introductionmentioning
confidence: 99%
“…The existence of such a process is in fact elementary and it can be constructed by piecing together Brownian motions in a rather direct way. The problem (1.1) can be also understood as a spectral problem for a non-self-adjoint graph with regular boundary conditions [9].…”
Section: Introductionmentioning
confidence: 99%
“…For a survey on this actively developing field and references we refer the reader to the monograph [32] and the survey articles [31,104,106]. In the present section we consider the Laplacian on a finite, not necessarily compact metric graph, equipped with δ or more general non-self-adjoint vertex couplings; for further recent work on non-self-adjoint quantum graphs see [89,90,126]. Furthermore, for the treatment of quantum graphs via boundary triples and similar techniques we refer to, e.g.…”
Section: Quantum Graphs With δ-Type Vertex Couplingsmentioning
confidence: 99%
“…To obtain our main theorem in its most general form we use similarity transformations and bounded perturbations. In this way we are able to generalize the boundary conditions for non-self adjoint and non-compact graphs given in [27,24], see Example 2.12, as well as the general boundary conditions in terms of "boundary subspaces" presented in [36,Sect. 6.5], see Subsection 3.6.…”
Section: Introductionmentioning
confidence: 96%