Spectral Determinant on Quantum Graphs
β Scribed by Eric Akkermans; Alain Comtet; Jean Desbois; Gilles Montambaux; Christophe Texier
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 454 KB
- Volume
- 284
- Category
- Article
- ISSN
- 0003-4916
No coin nor oath required. For personal study only.
β¦ Synopsis
We study the spectral determinant of the Laplacian on finite graphs characterized by their number of vertices V and bonds B. We present a path integral derivation which leads to two equivalent expressions of the spectral determinant of the Laplacian in terms of either a V_V vertex matrix or a 2B_2B link matrix that couples the arcs (oriented bonds) together. This latter expression allows us to rewrite the spectral determinant as an infinite product of contributions of periodic orbits on the graph. We also present a diagrammatic method that permits us to write the spectral determinant in terms of a finite number of periodic orbit contributions. These results are generalized to the case of graphs in a magnetic field. Several examples illustrating this formalism are presented and its application to the thermodynamic and transport properties of weakly disordered and coherent mesoscopic networks is discussed. 2000 Academic Press
1. INTRODUCTION AND MAIN RESULTS
This work is devoted to the study of the spectral properties of the Laplacian operator on finite graphs. This problem already has a long history. The properties
π SIMILAR VOLUMES
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the graphs, where the dynamics is mixing and the periodic orbits