Abstract

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a randomly chosen ball has a limiting distribution. We prove that any sequence of quantum graphs with uniformly bounded data has a convergent subsequence in this sense. We then consider the empirical spectral measure of a convergent sequence (with general boundary conditions and edge potentials) and show that it converges to the expected spectral measure of the limiting random rooted quantum graph. These results are similar to the discrete case, but the proofs are significantly different.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.