Related papers: Spectrally arbitrary pattern extensions
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
Graph vertex sampling set selection aims at selecting a set of ver-tices of a graph such that the space of graph signals that can be reconstructed exactly from those samples alone is maximal. In this context, we propose to extend sampling…
The spectral properties of a class of band matrices are investigated. The reconstruction of matrices of this special class from given spectral data is also studied. Necessary and sufficient conditions for that reconstruction are found. The…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
We say that a semigroup of matrices has a submultiplicative spectrum if the spectrum of the product of any two elements of the semigroup is contained in the product of the two spectra in question (as sets). In this note we explore an…
Based on a brief review on developments of number system, a new developed pattern is proposed. The quaternion is extended to a matrix form aI+bC+cB+dA, in which the unit matrix I and three special matrices C,B,A correspond to number 1 and…
We propose an alternative variational principle whose critical point is the algebraic plane curve associated to a matrix model (the spectral curve, i.e. the large $N$ limit of the resolvent). More generally, we consider a variational…
In recent years, the spectral analysis of appropriately defined kernel matrices has emerged as a principled way to extract the low-dimensional structure often prevalent in high-dimensional data. Here we provide an introduction to spectral…
Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…
Spectral triples (of compact type) are constructed on arbitrary separable quasidiagonal C*-algebras. On the other hand an example of a spectral triple on a non-quasidiagonal algebra is presented.
Two trace formulas for the spectra of arbitrary Hermitian matrices are derived by transforming the given Hermitian matrix $H$ to a unitary analogue. In the first type the unitary matrix is $e^{i(\lambda\II - H)}$ where $\lambda$ is the…
We present a triangulation--independent area--ordering prescription which naturally generalizes the well known path ordering one. For such a prescription it is natural that the two--form ``connection'' should carry three ``color'' indices…
We improve the state-of-the-art proof techniques for realizing various spectra of $\mathfrak{a}_{\text{T}}$ in order to realize arbitrarily large spectra. Thus, we make significant progress in addressing a question posed by Brian in his…
This note deals with the direct and inverse spectral analysis for a class of infinite band symmetric matrices. This class corresponds to operators arising from difference quations with usual and inner boundary conditions. We give a…
In many mathematical models for pattern formation, a regular hexagonal pattern is stable in an infinite region. However, laboratory and numerical experiments are carried out in finite domains, and this imposes certain constraints on the…
X-ray spectroscopy is a powerful technique for the analysis of the energy distribution of X-rays from astrophysical sources. It allows for the study of the properties, composition, and physical processes taking place at the site of…
In this article, the enumeration of partial chord diagrams is discussed via matrix model techniques. In addition to the basic data such as the number of backbones and chords, we also consider the Euler characteristic, the backbone spectrum,…
We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
A series-parallel matrix is a binary matrix that can be obtained from an empty matrix by successively adjoining rows or columns that are parallel to an existing row/column or have at most one 1-entry. Equivalently, series-parallel matrices…