Related papers: Convergent spectral inclusion sets for banded matr…
We consider the additive superimposition of an extensive number of independent Euclidean Random Matrices in the high-density regime. The resolvent is computed with techniques from free probability theory, as well as with the replica method…
Let $A$ and $B$ be two $N$ by $N$ deterministic Hermitian matrices and let $U$ be an $N$ by $N$ Haar distributed unitary matrix. It is well known that the spectral distribution of the sum $H=A+UBU^*$ converges weakly to the free additive…
We consider the approximate computation of spectral projectors for symmetric banded matrices. While this problem has received considerable attention, especially in the context of linear scaling electronic structure methods, the presence of…
This paper has an expository nature. We compare the spectral properties (such as boundedness and compactness) of three families of semi-infinite matrices and point out similarities between them. The common feature of these families is that…
We calculate the particle spectrum of the SSM which follows from the assumption that the commonly assumed universal form of the soft supersymmetry --breaking terms is invariant under renormalisation. It is argued that this ``strong''…
Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…
We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of…
Singular values of a data in a matrix form provide insights on the structure of the data, the effective dimensionality, and the choice of hyper-parameters on higher-level data analysis tools. However, in many practical applications such as…
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
First, we extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Second, We develop a class of fast approximate generalized linear regression algorithms with respect to the spectral norm.…
The slopes of maximal subbundles of rank $s$ divided by the degree of the map under various pull backs form a bounded collection of numbers called the $s$-spectrum of the bundle. We study the supremum of the $s$-spectrum and determine it in…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
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…
In the first part of this paper, the main concern is with smoothness properties of the boundary of the pseudospectrum of a matrix polynomial. In the second part, results are obtained concerning the number of connected components of…
The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.
We investigate the spectral statistics of Hermitian matrices in which the elements are chosen uniformly from U (1), called the uni-modular ensemble (UME), in the limit of large matrix size. Using three complimentary methods; a…
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…
In this paper, we compute the spectral norms of the matrices related with integer squences and we give some example related with Fibonacci, Lucas, Pell and Perrin numbers.
A new method to enclose the pseudospectrum via the numerical range of the inverse of a matrix or linear operator is presented. The method is applied to finite-dimensional discretizations of an operator on an infinite-dimensional Hilbert…
We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…