相关论文: Spectral analysis for adjacency operators on graph…
We describe a method for comparing the real analytic eigenbranches of two families of quadratic forms that degenerate as t tends to zero. One of the families is assumed to be amenable to `separation of variables' and the other one not. With…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…
We consider operators $H_\mu$ of convolution with measures $\mu$ on locally compact groups. We characterize the spectrum of $H_\mu$ by constructing auxiliary operators whose kernel contain the pure point and singular subspaces of $H_\mu$,…
By nonstandard analysis, a very short and elementary proof of the Spectral Theorem for unbounded self-adjoint operators is given.
A periodic linear graph operator acts on states (functions) defined on the vertices of a graph equipped with a free translation action. Fourier transform with respect to the translation group reveals the central spectral objects, Bloch and…
The study of complex networks has been one of the most active fields in science in recent decades. Spectral properties of networks (or graphs that represent them) are of fundamental importance. Researchers have been investigating these…
We consider equivariant continuous families of discrete one-dimensional operators over arbitrary dynamical systems. We introduce the concept of a pseudo-ergodic element of a dynamical system. We then show that all operators associated to…
We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
Let $H$ be a connected $m$-uniform hypergraph, and let $\mathcal{A}(H)$ be the adjacency tensor of $H$ whose spectrum is simply called the spectrum of $H$. Let $s(H)$ denote the number of eigenvectors of $\mathcal{A}(H)$ associated with the…
In this study, we explore the interrelation between hypergraph symmetries represented by equivalence relations on the vertex set and the spectra of operators associated with the hypergraph. We introduce the idea of equivalence relation…
Two graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues, and generalized cospectral if they are cospectral and so are their complements. We study generalized cospectrality in relation to…
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…
We consider discrete Schr\"odinger operators $H_{\mu Q}=\Delta+\mu Q$ with real periodic potentials $Q$ on periodic graphs, where $\Delta$ is the adjacency operator and $\mu\in\mathbb R$ is a coupling constant. The spectra of the operators…
Important spectral features, such as the emptiness of the residual spectrum, countability of the point spectrum, provided the space is separable, and a characterization of spectral gap at $0$, known to hold for bounded scalar type spectral…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We give necessary conditions for this Laplacian to be sectorial. We introduce a special self-adjoint operator and compare its essential spectrum…
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in the $1$-cut metric. On the other hand, we give examples of…