Related papers: Variational Analysis of Convexly Generated Spectra…

Let $G$ be a strongly connected digraph with $n$ vertices and $m$ arcs. For any real $\alpha\in[0,1]$, the $A_\alpha$ matrix of a digraph $G$ is defined as $$A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G),$$ where $A(G)$ is the adjacency matrix of…

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…

The (delta-) normal cone to an arbitrary intersection of sublevel sets of proper, lower semicontinuous, and convex functions is characterized, using either epsilon-subdifferentials at the nominal point or exact subdifferentials at nearby…

The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…

Nonlinear spectral gaps with respect to uniformly convex normed spaces are shown to satisfy a spectral calculus inequality that establishes their decay along Cesaro averages. Nonlinear spectral gaps of graphs are also shown to behave…

In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to…

The problem of the mean-square optimal linear estimation of functionals which depend on the unknown values of a stationary stochastic sequence from observations of the sequence with noise is considered. In the case of spectral certainty,…

A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…

This paper discusses a generalization of spectral representations related to convex one-homogeneous regularization functionals, e.g. total variation or $\ell^1$-norms. Those functionals serve as a substitute for a Hilbert space structure…

The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…

The $\alpha$-spectral radius of a connected graph $G$ is the spectral radius of $A_\alpha$-matrix of $G$. In this paper, we discuss the methods for comparing $\alpha$-spectral radius of graphs. As applications, we characterize the graphs…

We provide a first systematic treatment of so-called rectangular multispectral perturbation theory. With their paper from 2003, Hochstenbach and Plestenjak ["Backward Error, Condition Numbers, and Pseudospectra for the Multiparameter…

The minimax principle for eigenvalues in gaps of the essential spectrum in the form presented by Griesemer, Lewis, and Siedentop in [Doc. Math. 4 (1999), 275--283] is adapted to cover certain abstract perturbative settings with bounded or…

This paper considers sparse spiked covariance matrix models in the high-dimensional setting and studies the minimax estimation of the covariance matrix and the principal subspace as well as the minimax rank detection. The optimal rate of…

With every operator space structure $\mathcal{E}$ on $\mathbb{C}^d$, we associate a spectral radius function $\rho_{\mathcal{E}}$ on $d$-tuples of operators. For a $d$-tuple $X = (X_1, \ldots, X_d) \in M_n(\mathbb{C}^d)$ of matrices we show…

The aim of this manuscript is to derive bounds on the moduli of eigenvalues of special type of rational matrices of the form $T(\lambda) = \displaystyle -B_0 +I\lambda +\frac{B_1}{\lambda-\alpha_1}+ \dots+ \frac{B_m}{\lambda-\alpha_m}$,…

Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…

For a $n\times n$ unitary matrix $u=e^z$ with $z$ skew-Hermitian, the angles of $u$ are the arguments of its spectrum, i.e. the spectrum of $-iz$. For $1\le m\le n$, we show that $s_m(t)$, the sum of the first $m$ angles of the path…

We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many…

In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…