Related papers: Determinantal and eigenvalue inequalities for matr…

This paper considers $N\times N$ matrices of the form $A_\gamma =A+ \gamma B$, where $A$ is self-adjoint, $\gamma \in C$ and $B$ is a non-self-adjoint perturbation of $A$. We obtain some monodromy-type results relating the spectral…

We study an {\it indefinite weighted eigenvalue problem} for an operator of {\it mixed-type} (that includes both the classical {\it $p$-Laplacian} and the {\it fractional $p$-Laplacian}) in a bounded open subset $\Omega\subset \mathbb{R}^N…

In this paper, we propose an unconstrained framework for eigenvalue problems in both discrete and continuous settings. We begin our discussion to solve a generalized eigenvalue problem $A{\bf x} = \lambda B{\bf x}$ with two $N\times N$ real…

For random L\'evy matrices of size $N \times N$, where matrix elements are drawn with some heavy-tailed distribution $P(H_{ij}) \propto N^{-1} |H_{ij} |^{-1-\mu}$ with $0<\mu<2$ (infinite variance), there exists an extensive number of…

Using Grassmann variables and an analogy with two dimensional electrostatics, we obtain the average eigenvalue distribution $\rho(\omega)$ of ensembles of $N \times N$ asymmetrically diluted Hopfield matrices in the limit $N \rightarrow…

We characterize under what conditions $n\times n$ Hermitian matrices $A_1$ and $A_2$ have the property that the spectrum of $\cos t A_1 + \sin t A_2$ is independent of $t$ (thus, the trigonometric pencil $\cos t A_1 + \sin t A_2$ is…

Modern applications in statistics, computer science and network science have seen tremendous values of finer matrix spectral perturbation theory. In this paper, we derive a generic $\ell_{2\rightarrow\infty}$ eigenspace perturbation bound…

A common algorithm for the computation of eigenvalues of real symmetric tridiagonal matrices is the iteration of certain special maps $F_\sigma$ called shifted $QR$ steps. Such maps preserve spectrum and a natural common domain is ${\cal…

It is shown that certain ensembles of random matrices with entries that vanish outside a band around the diagonal satisfy a localization condition on the resolvent which guarantees that eigenvectors have strong overlap with a vanishing…

In contrast to the neatly bounded spectra of densely populated large random matrices, sparse random matrices often exhibit unbounded eigenvalue tails on the real and imaginary axis, called Lifshitz tails. In the case of asymmetric matrices,…

We study the high energy estimate for the resolvent $R(\lambda)$ of the Laplacian on non-trapping asymptotically hyperbolic manifolds (AHM). In the literature, polynomial bound of the form $\|R(\lambda)\| = O(|\lambda|^{N})$ for $|\lambda|$…

In this paper we study the structure and give bounds for the eigenvalues of the $n\times n$ matrix, which $ij$ entry is $(i,j)^\alpha[i,j]^\beta$, where $\alpha,\beta\in\Rset$, $(i,j)$ is the greatest common divisor of $i$ and $j$ and…

We consider a product of an arbitrary number of independent rectangular Gaussian random matrices. We derive the mean densities of its eigenvalues and singular values in the thermodynamic limit, eventually verified numerically. These…

By a ring we always mean a commutative ring with identity. It is well known that maximal spectrum of $C(X)$, $C^*(X)$ and any intermediate subrings between $C(X)$ and $C^* (X)$ are homeomorphic and homeomorphic with $\beta X$, the…

This paper deals with the principal eigenvalue of discrete $p$-Laplacian on the set of nonnegative integers. Alternatively, it is studying the optimal constant of a class of weighted Hardy inequalities. The main goal is the quantitative…

We address the problem of estimating a high-dimensional matrix from linear measurements, with a focus on designing optimal rank-adaptive algorithms. These algorithms infer the matrix by estimating its singular values and the corresponding…

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…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

It is well known that {\em superposition coding}, namely separately encoding the independent sources, is optimal for symmetric multilevel diversity coding (SMDC) (Yeung-Zhang 1999). However, the characterization of the coding rate region…