Related papers: Interlacing properties of the eigenvalues of some …

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…

In 2017, Nikiforov introduced the concept of the $A_{\alpha}$-matrix, as a linear convex combination of the adjacency matrix and the degree diagonal matrix of a graph. This matrix has attracted increasing attention in recent years, as it…

The diagonalization of matrices may be the top priority in the application of modern physics. In this paper, we numerically demonstrate that, for real symmetric random matrices with non-positive off-diagonal elements, a universal scaling…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

The article is devoted to establishing the distortion of the modulus of families of paths in wide classes of mappings that admit branch points. In particular, for mappings that are differentiable almost everywhere and have $N$- and $N^{\,-…

Let $G = (V, E)$ be a graph. We define matrices $M(G; \alpha, \beta)$as $\alpha D + \beta A$, where $\alpha$, $\beta$ are real numbers such that $(\alpha, \beta) \neq (0, 0)$ and $D$ and $A$ are the diagonal matrix and adjacency matrix of…

This is a continuation of our earlier paper on the universality of the eigenvalues of Wigner random matrices. The main new results of this paper are an extension of the results in that paper from the bulk of the spectrum up to the edge. In…

We consider path-connected sets of matrices and the induced paths between eigenvalues. We discuss the equivalence relation generated by these paths, and how it relates to the presence of higher multiplicity eigenvalues realized by the set.…

An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…

Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

It has been observed that the statistical distribution of the eigenvalues of random matrices possesses universal properties, independent of the probability law of the stochastic matrix. In this article we find the correlation functions of…

The current general form of the well-known Eigenvalue Interlacing Theorem states that, given an $N \times N$ Hermitian matrix $P$, the eigenvalues of the matrix product $Q^{H} P Q$ will interlace those of $P$ if the columns of the $N \times…

This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their…

We describe a new subclass of the class of real polynomials with real simple roots called self-interlacing polynomials. This subclass is isomorphic to the class of real Hurwitz stable polynomials (all roots in the open left half-plane). In…

We generalize Monge property of real matrices for interval matrices. We define two classes of interval matrices with Monge property - in a strong and in a weak sense. We study fundamental properties of both classes. We show several…

A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…

In this short article, some properties of matrices of moving least-squares approximation have been proven.The used technique is based on singular-value decomposition and inequalities for singular-values. Some inequalities for the norm of…