Results 1  10
of
17
Spectra of Schrödinger operators on equilateral quantum graphs
, 2006
"... We consider magnetic Schrödinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator. In particular, it is shown that the spectrum on the quantum g ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
We consider magnetic Schrödinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator. In particular, it is shown that the spectrum on the quantum graph is the preimage of the combinatorial spectrum under a certain entire function. Using this correspondence we show that that the number of gaps in the spectrum of the Schrödinger operators admits an estimate from below in terms of the Hill operator independently of the graph structure.
Anderson localization for radial treelike random quantum graphs
, 2008
"... We prove that certain random models associated with radial, treelike, rooted quantum graphs exhibit Anderson localization at all energies. The two main examples are the random length model (RLM) and the random Kirchhoff model (RKM). In the RLM, the lengths of each generation of edges form a family ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We prove that certain random models associated with radial, treelike, rooted quantum graphs exhibit Anderson localization at all energies. The two main examples are the random length model (RLM) and the random Kirchhoff model (RKM). In the RLM, the lengths of each generation of edges form a family of independent, identically distributed random variables (iid). For the RKM, the iid random variables are associated with each generation of vertices and moderate the current flow through the vertex. We consider extensions to various families of decorated graphs and prove stability of localization with respect to decoration. In particular, we prove Anderson localization for the random necklace model.
ON THE SPECTRA OF CARBON NanoStructures
, 2007
"... An explicit derivation of dispersion relations and spectra for periodic Schrödinger operators on carbon nanostructures (including graphene and all types of singlewall nanotubes) is provided. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
An explicit derivation of dispersion relations and spectra for periodic Schrödinger operators on carbon nanostructures (including graphene and all types of singlewall nanotubes) is provided.
Spectral convergence of noncompact quasionedimensional spaces
 Ann. H. Poincaré
"... Abstract. We consider a family of noncompact manifolds Xε (“graphlike manifolds”) approaching a metric graph X0 and establish convergence results of the related natural operators, namely the (Neumann) Laplacian ∆ Xε and the generalised Neumann (Kirchhoff) Laplacian ∆ X0 on the metric graph. In par ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We consider a family of noncompact manifolds Xε (“graphlike manifolds”) approaching a metric graph X0 and establish convergence results of the related natural operators, namely the (Neumann) Laplacian ∆ Xε and the generalised Neumann (Kirchhoff) Laplacian ∆ X0 on the metric graph. In particular, we show the norm convergence of the resolvents, spectral projections and eigenfunctions. As a consequence, the essential and the discrete spectrum converge as well. Neither the manifolds nor the metric graph need to be compact, we only need some natural uniformity assumptions. We provide examples of manifolds having spectral gaps in the essential spectrum, discrete eigenvalues in the gaps or even manifolds approaching a fractal spectrum. The convergence results will be given in a completely abstract setting dealing with operators acting in different spaces, applicable also in other geometric situations. 1.
EQUILATERAL QUANTUM GRAPHS AND BOUNDARY TRIPLES
"... Abstract. The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural generalisation of the discrete Laplace operator on the ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural generalisation of the discrete Laplace operator on the underlying graph. These generalised Laplacians are necessary in order to cover general vertex conditions on the metric graph. In case of the standard (also named “Kirchhoff”) conditions, the discrete operator is the usual combinatorial Laplacian. 1.
Eigenvalue bracketing for discrete and metric graphs
 J. Math. Anal. Appl
"... Abstract. We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph spectrum (also in the “exceptional” values of the m ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph spectrum (also in the “exceptional” values of the metric graph corresponding to the Dirichlet spectrum) we carry over these estimates from the metric graph Laplacian to the discrete case. We apply the results to covering graphs and present examples where the covering graph Laplacians have spectral gaps. 1.
CONTINUITY OF THE INTEGRATED DENSITY OF STATES ON RANDOM LENGTH METRIC GRAPHS
, 2008
"... We establish several properties of the integrated density of states for random quantum graphs: Under appropriate ergodicity and amenability assumptions, the integrated density of states can be defined using an exhaustion procedure by compact subgraphs. A trace per unit volume formula holds, similar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We establish several properties of the integrated density of states for random quantum graphs: Under appropriate ergodicity and amenability assumptions, the integrated density of states can be defined using an exhaustion procedure by compact subgraphs. A trace per unit volume formula holds, similarly as in the Euclidean case. Our setting includes periodic graphs. For a model where the edge lengths are random and vary independently in a smooth way we prove a Wegner estimate and related regularity results for the integrated density of states. These results are illustrated for an example based on the Kagome lattice. In the periodic case we characterise all compactly supported eigenfunctions and calculate the position and size of discontinuities of the integrated density of states.
SPECTRAL ANALYSIS OF METRIC GRAPHS AND RELATED SPACES
, 2008
"... The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and explicitly allow infinite graphs. Motivated by the general fo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and explicitly allow infinite graphs. Motivated by the general form of a Laplacian on a metric graph, we define a new type of combinatorial Laplacian. With this generalised discrete Laplacian, it is possible to relate the spectral theory on discrete and metric graphs. Moreover, we describe a connection of metric graphs with manifolds. Finally, we comment on Cheeger’s inequality and trace formulas for metric and discrete (generalised) Laplacians.
SPECTRAL ANALYSIS OF METRIC GRAPHS AND RELATED SPACES
, 2008
"... The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and explicitly allow infinite graphs. Motivated by the general f ..."
Abstract
 Add to MetaCart
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and explicitly allow infinite graphs. Motivated by the general form of a Laplacian on a metric graph, we define a new type of combinatorial Laplacian. With this generalised discrete Laplacian, it is possible to relate the spectral theory on discrete and metric graphs. Moreover, we describe a connection of metric graphs with manifolds. Finally, we comment on Cheeger’s inequality and trace formulas for metric and discrete (generalised) Laplacians.