Related papers: Concrete method for recovering the Euler character…
We introduce Lipschitz-Killing curvature (LKC) regression, a new method to produce $(1-\alpha)$ thresholds for signal detection in random fields that does not require knowledge of the spatial correlation structure. The idea is to fit…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
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…
Given a simple graph $G$, its Laplacian-energy-like invariant $LEL(G)$ and incidence energy $IE(G)$ are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. Applying the Cauchy-Schwarz…
Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical…
Consider two quantum graphs with the standard Laplace operator and non-Robin type boundary conditions at all vertices. We show that if their eigenvalue-spectra agree everywhere aside from a sufficiently sparse set, then the…
We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization…
We study the spectral convergence of a symmetrized Graph Laplacian matrix induced by a Gaussian kernel evaluated on pairs of embedded data, sampled from a manifold with boundary, a sub-manifold of $\mathbb{R}^m$. Specifically, we deduce the…
We undertake a systematic investigation of the maxima and minima of the eigenfunctions associated with the first nontrivial eigenvalue of the Laplacian on a metric graph equipped with standard (continuity--Kirchhoff) vertex conditions. This…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
We present a semi-Lagrangian characteristic mapping method for the incompressible Euler equations on a rotating sphere. The numerical method uses a spatio-temporal discretization of the inverse flow map generated by the Eulerian velocity as…
We investigate the relation between the eigenvalues of the Laplacian with Kirchhoff vertex conditions on a finite metric graph and a corresponding Titchmarsh-Weyl function (a parameter-dependent Neumann-to-Dirichlet map). We give a complete…
The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and…
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…
We derive eigenvalue bounds for the $t$-distance chromatic number of a graph, which is a generalization of the classical chromatic number. We apply such bounds to hypercube graphs, providing alternative spectral proofs for results by Ngo,…