2021
DOI: 10.4171/jst/346
|View full text |Cite
|
Sign up to set email alerts
|

Quantum graphs on radially symmetric antitrees

Abstract: We investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs admits a lot of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the orthogonal sum of Sturm-Liouville operators. In contrast to the case of radially symmetric trees, the deficiency indices of the Laplacian defined on the minimal domain are at most one and they are equal to one exactly when the corresponding metric antitree has finite total volume. In… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
25
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(27 citation statements)
references
References 38 publications
2
25
0
Order By: Relevance
“…If vol() < ∞, then Markovian extensions of 𝐇 0 form a one-parameter family explicitly given by (6.17). Note that (6.17) looks similar to the description of self-adjoint extensions of the minimal Kirchhoff Laplacian on radially symmetric antitrees obtained recently in [56].…”
Section: Proof Of Theorem 71supporting
confidence: 73%
See 2 more Smart Citations
“…If vol() < ∞, then Markovian extensions of 𝐇 0 form a one-parameter family explicitly given by (6.17). Note that (6.17) looks similar to the description of self-adjoint extensions of the minimal Kirchhoff Laplacian on radially symmetric antitrees obtained recently in [56].…”
Section: Proof Of Theorem 71supporting
confidence: 73%
“…Example Consider a metric antitree scriptG=scriptA${\mathcal {G}}= {\mathcal {A}}$ (see Section 7.1 for definitions) and additionally suppose that A${\mathcal {A}}$ is radially symmetric , that is, for each n0$n\geqslant 0$, all edges between the combinatorial spheres Sn$S_n$ and Sn+1$S_{n+1}$ have the same length. Combining [56, Theorem 4.1] (see also Corollary 7.3) with the fact that antitrees have exactly one graph end, #frakturCfalse(scriptAfalse)=1$\# \mathfrak {C}({\mathcal {A}}) = 1$, we conclude that n±(boldH0)=#C0(G)={1,ifvol(A)<,0,ifvol(A)=.\begin{equation*} {\rm {n}}_\pm ({\mathbf {H}}_0) = \# \mathfrak {C}_0({\mathcal {G}}) = {\begin{cases} 1, &\text{if } {\rm {vol}}({\mathcal {A}}) &lt; \infty , \\ 0, & \text{if } {\rm {vol}}({\mathcal {A}}) = \infty . \end{cases}} \end{equation*}In particular, H${\mathbf {H}}$ is self‐adjoint if and only if volfalse(scriptAfalse)=${\rm {vol}}({\mathcal {A}}) = \infty$.…”
Section: Deficiency Indicesmentioning
confidence: 99%
See 1 more Smart Citation
“…However, we expect that our methods are fairly universal and can be used to consider other operators. Also, we believe that some of our results can find applications in the theory of Gaussian stochastic processes (see, e.g., [25] for background), wave equations with fractal Laplacians [13], and scattering theory on quantum graphs [44].…”
Section: String Equationmentioning
confidence: 94%
“…This characterization was obtained in [5]. Below, we give somewhat more general version which has already been applied in the theory of quantum graphs (see, e.g., [44]).…”
Section: String Equationmentioning
confidence: 94%