Related papers: Optimization of quantum graph eigenvalues with pre…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…
In this paper we show that all nodes can be found optimally for almost all random Erd\H{o}s-R\'enyi ${\mathcal G}(n,p)$ graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices,…
We discuss approximations of the vertex coupling on a star-shaped quantum graph of $n$ edges in the singular case when the wave functions are not continuous at the vertex and no edge-permutation symmetry is present. It is shown that the…
In this paper, we give a lower bound for the spectrum of the Laplacian on minimal hypersurfaces immersed into $H^m \times R$. As an application, in dimension 2, we prove that a complete minimal surface with finite total extrinsic curvature…
We prove sharp upper bounds for eigenvalues of Schr\"odinger operators on quantum graphs with $\delta$-coupling (also known as Robin) conditions at all vertices. The bounds depend on the geometry of the graph, on the potential, and 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…
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…
We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
We obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some…
The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…
The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…
In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices. We give some basic properties and…
We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…