Results 1 
4 of
4
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.
DEPENDENCE OF THE SPECTRUM OF A QUANTUM GRAPH ON VERTEX CONDITIONS AND EDGE LENGTHS
"... Abstract. We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with different vertex conditions are obtained and their applica ..."
Abstract
 Add to MetaCart
Abstract. We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with different vertex conditions are obtained and their applications are discussed. 1.
Convergence results for thick graphs Olaf Post
, 2010
"... Many physical systems have branching structure of thin transversal diameter. One can name for instance quantum wire circuits, thin branching waveguides, or carbon nanostructures. In applications, such systems are often approximated by the underlying onedimensional graph structure, a socalled “quant ..."
Abstract
 Add to MetaCart
Many physical systems have branching structure of thin transversal diameter. One can name for instance quantum wire circuits, thin branching waveguides, or carbon nanostructures. In applications, such systems are often approximated by the underlying onedimensional graph structure, a socalled “quantum graph”. In this way, many properties of the system like conductance can be calculated easier (sometimes even explicitly). We give an overview of convergence results obtained so far, such as convergence of Schrödinger operators, Laplacians and their spectra. 1
GENERALISED DISCRETE LAPLACIANS ON GRAPHS AND THEIR RELATION TO QUANTUM GRAPHS
"... Abstract. The aim of the present paper is to analyse the spectrum of Laplace operators on graphs. Motivated by the general form of vertex conditions 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 t ..."
Abstract
 Add to MetaCart
Abstract. The aim of the present paper is to analyse the spectrum of Laplace operators on graphs. Motivated by the general form of vertex conditions 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 using the theory of boundary triples. In particular, we derive a spectral relation for equilateral metric graphs and index formulas. Moreover, we introduce extended metric graphs occuring naturally as limits of “thick ” graphs, and provide spectral analysis of natural Laplacians on such spaces. 1.