Related papers: Quantum graphs -- Generic eigenfunctions and their…
Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
Quantum graphs are an operator space generalization of classical graphs that have emerged in different branches of mathematics including operator theory, non-commutative topology and quantum information theory. In this paper, we obtain…
We solve for quantum Riemannian geometries on the finite lattice interval $\bullet-\bullet-\cdots-\bullet$ with $n$ nodes (the Dynkin graph of type $A_n$) and find that they are necessarily $q$-deformed with $q=e^{\imath\pi\over n+1}$. This…
A Laplacian eigenfunction on a two-dimensional manifold dictates some natural partitions of the manifold; the most apparent one being the well studied nodal domain partition. An alternative partition is revealed by considering a set of…
According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes:…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
We consider the Laplacian on a metric graph, equipped with Robin ($\delta$-type) vertex condition at some of the graph vertices and Neumann-Kirchhoff condition at all others. The corresponding eigenvalues are called Robin eigenvalues,…
In this Thesis, we study the behavior of spectral curves of quantum graphs under certain families of vertex conditions, called the $\delta_s$ family, which we define in this work. We focus on studying two main quantities related to the…
Recent work of the authors and their collaborators has uncovered fundamental connections between the Dirichlet-to-Neumann map, the spectral flow of a certain family of self-adjoint operators, and the nodal deficiency of a Laplacian…
In an attempt to characterize the structure of eigenvectors of random regular graphs, we investigate the correlations between the components of the eigenvectors associated to different vertices. In addition, we provide numerical…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…
The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…
We give three different proofs of the main result of Anantharaman-Le Masson, establishing quantum ergodicity -- a form of delocalization --for eigenfunctions of the laplacian on large regular graphs of fixed degree. These three proofs are…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…