Related papers: Lower spectral radius and spectral mapping theorem…
This paper investigates the maximum spectral radius of planar graphs with concrete fixed number of vertices, providing some tight bounds on the maximum spectral radius of general planar graph resorting to its order, and confirming that…
The spectral abscissa is the largest real part of an eigenvalue of a matrix and the spectral radius is the largest modulus. Both are examples of spectral max functions---the maximum of a real-valued function over the spectrum of a matrix.…
In distributed optimization or Nash-equilibrium seeking over directed graphs, it is crucial to find a matrix norm under which the disagreement of individual agents' states contracts. In existing results, the matrix norm is usually defined…
One of the aims of this paper is to solve an open problem of Lovasz about relations between graph spectra and cut-distance. The paper starts with several inequalities between two versions of the cut-norm and the two largest singular values…
In this paper a complete description of the linear maps $\phi:W_{n}\rightarrow W_{n}$ that preserve the Lorentz spectrum is given when $n=2$ and $W_{n}$ is the space $M_{n}$ of $n\times n$ real matrices or the subspace $S_{n}$ of $M_{n}$…
In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…
The local spectrum of a vertex set in a graph has been proven to be very useful to study some of its metric properties. It also has applications in the area of pseudo-distance-regularity around a set and can be used to obtain quasi-spectral…
Let ${\mathcal B}(X)$ be the algebra of all bounded linear operators on an infinite dimensional complex Banach space $X$. We prove that an additive surjective map $\phi$ on ${\mathcal B}(X)$ preserves the reduced minimum modulus if and only…
We investigate combinatorial properties of certain configurations of a graph partition which are related to the minimality of a cut. We show that such configurations are related to the third eigenvector of the Laplacian matrix. It is well…
Using quantitative perturbation theory for linear operators, we prove spectral gap for transfer operators of various families of intermittent maps with almost constant potentials ("high-temperature" regime). H\"older and bounded p-variation…
We present several results describing the interplay between the max algebraic joint spectral radius (JSR) for compact sets of matrices and suitably defined matrix norms. In particular, we extend a classical result for the conventional…
We study, for the first time, the maximum modulus set of a quasiregular map. It is easy to see that these sets are necessarily closed, and contain at least one point of each modulus. Blumenthal showed that for entire maps these sets are…
An $n \times n$ matrix $A$ with real entries is said to be Schur stable if all the eigenvalues of $A$ are inside the open unit disc. We investigate the structure of linear maps on $M_n(\mathbb{R})$ that preserve the collection $\mathcal{S}$…
In 2002 F. Wirth has proved that the joint spectral radius of irreducible compact sets of matrices is locally Lipschitz continuous as a function of the matrix set. In the paper, an explicit formula for the related Lipschitz constant is…
Let $\mathcal{M}$ be a smooth submanifold of $\mathbb{R}^n$ equipped with the Euclidean (chordal) metric. This note considers the smallest dimension $m$ for which there exists a bi-Lipschitz function $f: \mathcal{M} \mapsto \mathbb{R}^m$…
The normalized distance Laplacian of a graph $G$ is defined as $\mathcal{D}^\mathcal{L}(G)=T(G)^{-1/2}(T(G)-\mathcal{D}(G))T(G)^{-1/2}$ where $\mathcal{D}(G)$ is the matrix with pairwise distances between vertices and $T(G)$ is the diagonal…
In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also determine the graphs whose spectral radius and distance…
In this paper, we present two sharp upper bounds for the spectral radius of (bipartite) graphs with forbidden a star forest and characterize all extremal graphs. Moreover, the minimum least eigenvalue of the adjacency matrix of graph with…
We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…
In this paper, we consider low rank matrix estimation using either matrix-version Dantzig Selector $\hat{A}_{\lambda}^d$ or matrix-version LASSO estimator $\hat{A}_{\lambda}^L$. We consider sub-Gaussian measurements, $i.e.$, the…