Related papers: Quantum ergodicity for large equilateral quantum g…
Spectral problems are considered generated by the Sturm-Liouville equation on equilateral trees with the Dirichlet boundary conditions at the pendant vertices and continuity and Kirchhoff's conditions at the interior vertices. It is proved…
We prove quantum unique ergodicity for a subspace of the continuous spectrum spanned by the degenerate Eisenstein Series on GL(n).
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
We look at the various aspects of treating general relativity as a quantum theory. It is briefly studied how to consistently quantize general relativity as an effective field theory. A key achievement here is the long-range low-energy…
We introduce a new model for investigating spectral properties of quantum graphs, a quantum circulant graph. Circulant graphs are the Cayley graphs of cyclic groups. Quantum circulant graphs with standard vertex conditions maintain…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…
We deal with a spectral problem for the Laplace-Beltrami operator posed on a stratified set $\Omega$ which is composed of smooth surfaces joined along a line $\gamma$, the junction. Through this junction we impose the Kirchhoff-type vertex…
We study the transmission of a quantum particle along a straight input--output line to which a graph $\Gamma$ is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
For every regular graph, we define a sequence of integers, using the recursion of the Martin polynomial. This sequence counts spanning tree partitions and constitutes the diagonal coefficients of powers of the Kirchhoff polynomial. We prove…
In this article we formulate and discuss one particle quantum scattering theory on an arbitrary finite graph with $n$ open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general boundary conditions at the…
For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
Quantum measurements are inherently probabilistic and quantum theory often forbids to precisely predict the outcomes of simultaneous measurements. This phenomenon is captured and quantified through uncertainty relations. Although studied…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
Quantum graphs model processes in complex systems represented as spatial networks in various fields of natural science and technology. An example is the oscillations of elastic string networks, the nodes of which, besides the continuity…
This is partly a survey article for Constructive Approximation's Special Issue on Approximation and Statistical Physics. It reviews results of B. Shiffman-S.Zelditch, R. Berman. S. Boucksom, D. Witt-Nystrom, T. Bloom, O. Zeitouni and others…
We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…