相关论文: Spectral analysis for adjacency operators on graph…
We consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…
We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of an associated asymmetric transition probability matrix, extending the classical spectral inequality to the asymmetric setting. As an application, we…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We will use free probability techniques to find lower bounds for the spectral radii of the adjacency operators on the Caley graphs of some non-amenable Baumslag-Solitar groups with the standard generators.
We consider the self-adjoint fourth-order operator with real $1$-periodic coefficients on the unit interval. The spectrum of this operator is discrete. We determine the high energy asymptotics for its eigenvalues.
We investigate whether it is typical for a sparse graph to be uniquely characterized by its adjacency spectrum up to isomorphism. Our first result shows that the giant component of an Erd\H{o}s-R\'enyi graph is cospectral when the average…
We establish the various properties as well as diverse relations of the ascent and descent spectra for bounded linear operators. We specially focus on the theory of subspectrum. Furthermore, we construct a new concept of convergence for…
We consider the space-fractional operator with order $0<\alpha<1$ on the metric star graph. The boundary conditions at the vertices of the metric star graph providing the self-adjointness of the operator are derived. The obtained result is…
Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some conventional notions of apparently different…
We study the spectrum of a periodic non-self-adjoint Dirac operator, and its dependence on a semiclassical parameter is also considered. Several bounds on the spectrum are obtained which provide sharp spectral enclosure estimates.…
In this paper we prove that a class of non self-adjoint second order differential operators acting in cylinders $\Omega\times\mathbb R\subseteq\mathbb R^{d+1}$ have only real discrete spectrum located to the right of the right most point of…
In this paper, we consider spectral problem for the nth order ordinary differential operator with degenerate boundary conditions. We construct a nontrivial example of boundary value problem which has no eigenvalues.
In this paper, we study self-adjointness and spectrum of operators of the form $$H=\displaystyle -\frac{d^2}{dx^2}+Fx, F>0 \quad\text{on} \quad \mathcal{H}=L^{2}(-L,L).$$ $H$ is called Stark operator and describes a quantum particle in a…
We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be…
We consider an inverse problem for Schr\"odinger operators on connected equilateral graphs with standard matching conditions. We calculate the spectral determinant and prove that the asymptotic distribution of a subset of its zeros can be…
We present the first steps towards the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to 1 or -1. Here we deal with the disconnected, the bipartite and the complete signed graphs.…
A cograph is a simple graph which contains no path on 4 vertices as an induced subgraph. We consider the eigenvalues of adjacency matrices of cographs and prove that a graph $G$ is a cograph if and only if no induced subgraph of $G$ has an…
In this paper, we introduce a new graph whose vertices are the nonzero zero-divisors of commutative ring $R$ and for distincts elements $x$ and $y$ in the set $Z(R)^{\star}$ of the nonzero zero-divisors of $R$, $x$ and $y$ are adjacent if…