Related papers: Right-left asymmetry of the eigenvector method: A …
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
We give an upper bound on the total variation distance between the linear eigenvalue statistic, properly scaled and centred, of a random matrix with a variance profile and the standard Gaussian random variable. The second order Poincar\'e…
In this paper, we consider the shift-inverse method with Richardson iteration step for the eigenvalue problems. It will be shown that the convergence speed depends heavily on the eigenvalue gap between the desired eigenvalue and undesired…
Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…
Enforcing exact symmetry in machine learning models often yields significant gains in scientific applications, serving as a powerful inductive bias. However, recent work suggests that relying on approximate symmetry can offer greater…
It is well-known that the left term of the classical Hermite-Hadamard inequality is closer to the integral mean value than the right one. We show that in the multivariate case it is not true. Moreover, we introduce some related inequality…
Finding the eigenvalues connected to the covariance operator of a centred Hilbert-space valued Gaussian process is genuinely considered a hard problem in several mathematical disciplines. In statistics this problem arises for instance in…
Motivated by a problem in learning theory, we are led to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the derivative of random polynomials (generated by picking their roots…
In the paper the maximum and the minimum of the ratio of the difference of the arithmetic mean and the geometric mean, and the difference of the power mean and the geometric mean of $n$ variables, are studied. A new optimization argument…
We study in this article multiplicities of eigenvalues of tensors. There are two natural multiplicities associated to an eigenvalue $\lambda$ of a tensor: algebraic multiplicity $\operatorname{am}(\lambda)$ and geometric multiplicity…
For a broad class of models widely used in practice for choice and ranking data based on Luce's choice axiom, including the Bradley--Terry--Luce and Plackett--Luce models, we show that the associated maximum likelihood estimation problems…
In many contexts the modal properties of a structure change, either due to the impact of a changing environment, fatigue, or due to the presence of structural damage. For example during flight, an aircraft's modal properties are known to…
We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graph ${\bf G}(N,p)$. For $N^{-1+o(1)}\leq p\leq 1/2$, we show that the non-trivial edge eigenvectors are asymptotically jointly normal.…
This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…
We study the Rayleigh quotient of a Hermitian matrix with quaternionic coefficients and prove its main properties. As an application, we give some relationships between left and right eigenvalues of Hermitian and symplectic matrices.
Randomized algorithms that base iteration-level decisions on samples from some pool are ubiquitous in machine learning and optimization. Examples include stochastic gradient descent and randomized coordinate descent. This paper makes…
This paper presents solutions to the following two common quaternion attitude estimation problems: (i) estimation of attitude using measurement of two reference vectors, and (ii) estimation of attitude using rate measurement and measurement…
We study ridge estimation of the precision matrix in the high-dimensional setting where the number of variables is large relative to the sample size. We first review two archetypal ridge estimators and note that their utilized penalties do…
We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…
In this paper, we develop a new technique which we call representation theory of the real hyperrectangle, which describes how to compute the eigenvectors and eigenvalues of certain matrices arising from hyperrectangles. We show that these…