Related papers: Subordinacy Theory on Star-Like Graphs
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete laplacian is under consideration. The rate of stabilization for the the matrix entries which provides finiteness of the discrete spectrum and is…
The Jacobian is an algebraic invariant of a graph which is often seen in analogy to the class group of a number field. In particular, there have been multiple investigations into the Iwasawa theory of graphs with the Jacobian playing the…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
A new way of encoding a non-self-adjoint Jacobi matrix $J$ by a spectral measure of $|J|$ together with a phase function was described by Pushnitski--\v Stampach in the bounded case. We present another perspective on this correspondence,…
Recent results of Denisov and Kaluzhny-Shamis describe the absolutely continuous spectrum of Jacobi matrices with coefficients that obey an l^2 bounded variation condition with step p and are asymptotically periodic. We extend these results…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
We consider self-adjoint unbounded Jacobi matrices with diagonal q_n=n and weights \lambda_n=c_n n, where c_n is a 2-periodical sequence of real numbers. The parameter space is decomposed into several separate regions, where the spectrum is…
Given the adjacency matrix of an undirected graph, we define a coupling of the spectral measures at the vertices, whose moments count the rooted closed paths in the graph. The resulting joint spectral measure verifies numerous interesting…
Spectral properties of Jacobi operators $J$ are intimately related to an asymptotic behavior of the corresponding orthogonal polynomials $P_{n}(z)$ as $n\to\infty$. We study the case where the off-diagonal coefficients $a_{n}$ and,…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
We study Jacobi matrices on trees with one end at inifinity. We show that the defect indices cannot be greater than 1 and give criteria for essential selfadjointness. We construct certain polynomials associated with matrices, which mimic…
In this work the method of analyzing of the absolutely continuous spectrum for self-adjoint operators is considered. For the analysis it is used an approximation of self-adjoint operator $A$ by a sequence of operators $A_n$ with absolutely…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
Bounds on the exponential decay of generalized eigenfunctions of bounded and unbounded selfadjoint Jacobi matrices are established. Two cases are considered separately: (i) the case in which the spectral parameter lies in a general gap of…
A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by…
We are interested in the phenomenon of the essential spectrum instability for a class of unbounded (block) Jacobi matrices. We give a series of sufficient conditions for the matrices from certain classes to have a discrete spectrum on a…
We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…