Related papers: Intermediate statistics for a system with symplect…
This work is concerned with the Dirac points for the honeycomb lattice with impenetrable obstacles arranged periodically in a homogeneous medium. We consider both the Dirichlet and Neumann eigenvalue problems and prove the existence of…
The half-line Dirac operators with $L^2$-potentials can be characterized by their spectral data. It is known that the spectral correspondence is a homeomorphism: close potentials give rise to close spectral data and vice versa. We prove the…
We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the…
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the…
We study the (massless) Dirac operator on a 3-sphere equipped with Riemannian metric. For the standard metric the spectrum is known. In particular, the eigenvalues closest to zero are the two double eigenvalues +3/2 and -3/2. Our aim is to…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
The spectral propinquity is a distance, up to unitary equivalence, on the class of metric spectral triples. We prove in this paper that if a sequence of metric spectral triples converges for the propinquity, then the spectra of the Dirac…
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
We establish a sharp extrinsic lower bound for the first eigenvalue of the Dirac operator of an untrapped surface in initial data sets without apparent horizon in terms of the norm of its mean curvature vector. The equality case leads to…
Recently, Kalkreuter obtained the complete Dirac spectrum for an $SU(2)$ lattice gauge theory with dynamical staggered fermions on a $12^4$ lattice for $\beta =1.8$ and $\beta=2.8$. We performed a statistical analysis of his data and found…
A finite non-commutative geometry consists of a fuzzy space together with a Dirac operator satisfying the axioms of a real spectral triple. This paper addreses the question of how to extract information about these geometries from the…
We investigate spectral features of the Dirac operator with infinite mass boundary conditions in a smooth bounded domain of $\mathbb{R}^2$. Motivated by spectral geometric inequalities, we prove a non-linear variational formulation to…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
In this note we present some properties of the Dirac operator on noncompact metric graphs with Kirchoff-type vertex conditions. In particular, we discuss the specific features of the spectrum of the operator and, finally, we give some…
The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…
The Dirac operator provides a unified framework for processing signals defined over different order topological domains, such as node and edge signals. Its eigenmodes define a spectral representation that inherently captures cross-domain…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…
We consider the self-adjoint Dirac operators on a finite interval with summable matrix-valued potentials and general boundary conditions. For such operators, we study the inverse problem of reconstructing the potential and the boundary…