相关论文: Normalitity preserving perturbations and augmentat…

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

Isospectral transformations (IT) of matrices and networks allow for compression of either object while keeping all the information about their eigenvalues and eigenvectors.We analyze here what happens to generalized eigenvectors under…

Data augmentation is one of the most popular techniques for improving the robustness of neural networks. In addition to directly training the model with original samples and augmented samples, a torrent of methods regularizing the distance…

{Recently, we found that the correlation between the eigenvalues of random hermitean matrices exhibits universal behavior. Here we study this universal behavior and develop a diagrammatic approach which enables us to extend our previous…

In this paper, we propose a unified approach for solving structure-preserving eigenvalue embedding problem (SEEP) for quadratic regular matrix polynomials with symmetry structures. First, we determine perturbations of a quadratic matrix…

A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…

We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the…

We explore the concept of eigenvalue avoidance, which is well understood for real symmetric and Hermitian matrices, for other classes of structured matrices. We adopt a differential geometric perspective and study the generic behaviour of…

We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay…

For piecewise expanding one-dimensional maps without periodic turning points we prove that isolated eigenvalues of small (random) perturbations of these maps are close to isolated eigenvalues of the unperturbed system. (Here ``eigenvalue''…

We study an elementary inequality supporting the classical Hermite-Hadamard inequality in the matrix setting. This leads to a number of interesting matrix inequalities such new Schatten p-norm estimates and new majorization

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

An upper bound for the number of distinct eigenvalues of a perturbed matrix has been recently established by P. E. Farrell [1, Theorem 1.3]. The estimate is the central result in Farrell's work and can be applied to estimate the number of…

Consider a matrix function f defined for Hermitian matrices. The purpose of this paper is two-fold. We derive new results for the absolute structured condition number of the matrix function and we derive new bounds for the perturbation…

This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…

Numerical computations involving rational matrices often benefit from preserving underlying matrix structures such as symmetry, Hermitian properties, or sparsity that reflect physical, geometric, or algebraic characteristics of the system.…

Normalized eigenvalue counting measure of the sum of two Hermitian (or real symmetric) matrices $A_{n}$ and $B_{n}$ rotated independently with respect to each other by the random unitary (or orthogonal) Haar distributed matrix $U_{n}$ (i.e.…

The effect of multiplicative stochastic perturbations on Hamiltonian systems on the plane is investigated. It is assumed that perturbations fade with time and preserve a stable equilibrium of the limiting system. The paper investigates…

In this paper we study how perturbing a matrix changes its non-negative rank. We prove that the non-negative rank is upper-semicontinuos and we describe some special families of perturbations. We show how our results relate to Statistics in…

The randomised Horn problem, in both its additive and multiplicative version, has recently drawn increasing interest. Especially, closed analytical results have been found for the rank-1 perturbation of sums of Hermitian matrices and…