Spectral determinant on quantum graphs
arXiv:cond-mat/9911183 · doi:10.1006/aphy.2000.6056
Abstract
We study the spectral determinant of the Laplacian on finite graphs characterized by their number of vertices V and of bonds B. We present a path integral derivation which leads to two equivalent expressions of the spectral determinant of the Laplacian either in terms of a V x V vertex matrix or a 2B x 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.
33 pages, submitted to Ann. Phys
References in corpus (3)
Cited by in corpus (44)
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Quantum Graphs: A simple model for Chaotic Scattering
- Directed Chaotic Transport in Hamiltonian Ratchets
- Scattering on compact manifolds with infinitely thin horns
- Unitary stochastic matrix ensembles and spectral statistics
- Functionals of the Brownian motion, localization and metric graphs
- Survival of classical and quantum particles in the presence of traps
- Scattering theory on graphs
- Dirac and magnetic Schrödinger operators on fractals
- Transport and dynamics on open quantum graphs
- Direct measurement of the phase coherence length in a GaAs/GaAlAs square network
- Quantum Graphs: A model for Quantum Chaos
- Classical dynamics on graphs
- Dephasing due to electron-electron interaction in a diffusive ring
- Weak localization in multiterminal networks of diffusive wires
- Finite pseudo orbit expansions for spectral quantities of quantum graphs
- Universality of the momentum band density of periodic networks
- Scattering theory on graphs (2): the Friedel sum rule
- Time-Energy coherent states and adiabatic scattering
- Exact, convergent periodic-orbit expansions of individual energy eigenvalues of regular quantum graphs
- Quantum oscillations and decoherence due to electron-electron interaction in metallic networks and hollow cylinders
- Statistical properties of resonance widths for open Quantum Graphs
- Localization effects in a periodic quantum graph with magnetic field and spin-orbit interaction
- Local Friedel sum rule on graphs
- One-dimensional disordered quantum mechanics and Sinai diffusion with random absorbers
- Zeta functions of quantum graphs
- The Local Time Distribution of a Particle Diffusing on a Graph
- Quantum oscillations in mesoscopic rings and anomalous diffusion
- Exit and Occupation times for Brownian Motion on Graphs with General Drift and Diffusion Constant
- Non-linear conductance in mesoscopic weakly disordered wires -- Interaction and magnetic field asymmetry
- Thermal noise and dephasing due to electron interactions in non-trivial geometries
- Spectra of regular quantum graphs
- Charge and currents distribution in graphs
- Spectral determinants and zeta functions of Schrödinger operators on metric graphs
- On the spectrum of the Laplace operator of metric graphs attached at a vertex -- Spectral determinant approach
- Dirichlet Forms on Laakso and Barlow-Evans Fractals of Arbitrary Dimension
- Spectral determinant for the damped wave equation on an interval
- Al'tshuler-Aronov correction to the conductivity of a large metallic square network
- Four-terminal resistances in mesoscopic networks of metallic wires: Weak localisation and correlations
- -regularised spectral determinants on metric graphs
- Spectral Properties of Quantum Circulant Graphs
- A sub-determinant approach for pseudo-orbit expansions of spectral determinants in quantum maps and quantum graphs
- Eigenmodes of a Laplacian on Some Laakso Spaces
- A combinatorial approach to counting primitive periodic and primitive pseudo orbits on circulant graphs