Related papers: Impediments to diffusion in quantum graphs: geomet…

Let $G$ be a simple connected undirected graph. The Laplacian spectral ratio of $G$, denoted by $R_L(G)$, is defined as the quotient between the largest and second smallest Laplacian eigenvalues of $G$, which is closely related to the…

We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…

Graph diffusion models have made significant progress in learning structured graph data and have demonstrated strong potential for predictive tasks. Existing approaches typically embed node, edge, and graph-level features into a unified…

Kahale proved that linear sized sets in $d$-regular Ramanujan graphs have vertex expansion $\sim\frac{d}{2}$ and complemented this with construction of near-Ramanujan graphs with vertex expansion no better than $\frac{d}{2}$. However, the…

A chain of quantum subgroups of the quantum automorphism group of finite graphs has been introduced. It generalizes the construction of J. Bichon (see [3]) in a sense. A better bound of the non zero eigenvalues of the graph Laplacian has…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…

In this brief paper we present some results on creating and manipulating spectral gaps for a (regular) quantum graph by inserting appropriate internal structures into its vertices. Complete proofs and extensions of the results are planned…

Research on the relationship of the (signless Laplacian) spectral radius of a graph with its structure properties is an important research project in spectral graph theory. Denote by $\rho(G)$ and $q(G)$ the spectral radius and the signless…

In this paper, we extend the sharp lower bounds of spectal gap, due to Chen- Wang [10, 11], Bakry-Qian [6] and Andrews-Clutterbuck [5], from smooth Riemaniannian manifolds to general metric measure spaces with Riemannian curvature-dimension…

We prove several relations between spectrum and dynamics including wave trace expansion, sharp/improved Weyl laws, propagation of singularities and quantum ergodicity for the sub-Riemannian (sR) Laplacian in the four dimensional…

For a compact connected Riemannian manifold with smooth boundary, we establish an effective procedure, by which we can calculate all the coefficients of the spectral asymptotic formula of the Dirichlet-to-Neumann map associated to the…

The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…

In this paper, we study the problem of scattering by several strictly convex obstacles, with smooth boundary and satisfying a non eclipse condition. We show, in dimension 2 only, the existence of a spectral gap for the meromorphic…

The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…

We investigate the influence of diffraction on the statistics of energy levels in quantum systems with a chaotic classical limit. By applying the geometrical theory of diffraction we show that diffraction on singularities of the potential…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…

We show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on $n$ vertices is $(1+o(1))\tfrac{54}{n^3}$. This minimum is achieved asymptotically by a double kite graph. Consequently, this leads to sharp…

We obtain an upper heat kernel bound for the Laplacian on metric graphs arising as one skeletons of certain polygonal tilings of the plane, which reflects the one dimensional as well as the two dimensional nature of these graphs.