相关论文: Variational Analysis of Convexly Generated Spectra…

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…

The weighted adjacency matrix $A_{f}(G)$ of a simple graph $G=(V,E)$ is the $|V|\times|V|$ matrix whose $ij$-entry equals $f(d_{i},d_j)$, where $f(x,y)$ is a symmetric function such that $f(d_i,d_j)>0$ if $ij\in E$ and $f(d_i,d_j)=0$ if…

In general or normal random matrix ensembles, the support of eigenvalues of large size matrices is a planar domain (or several domains) with a sharp boundary. This domain evolves under a change of parameters of the potential and of the size…

Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…

We investigate upper bounds for the spectral ratios and gaps for the Steklov eigenvalues of balls with revolution-type metrics. We do not impose conditions on the Ricci curvature or on the convexity of the boundary. We obtain optimal upper…

We investigate the relation between the spectrum of a non-normal matrix and the norm of its resolvent. We provide spectral estimates for the resolvent of matrices whose largest singular value is bounded by $1$ (so-called Hilbert space…

The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…

In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…

We study maximal regularity with respect to continuous functions for strongly continuous semigroups on locally convex spaces as well as its relation to the notion of admissible operators. This extends several results for classical strongly…

Given a finite sequence of vectors $\mathcal F_0$ in $\C^d$ we describe the spectral and geometrical structure of optimal completions of $\mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality…

Let $spex(n,H_{minor})$ denote the maximum spectral radius of $n$-vertex $H$-minor free graphs. The problem on determining this extremal value can be dated back to the early 1990s. Up to now, it has been solved for $n$ sufficiently large…

We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree diagonal matrix $D (G)$. In 2017, Nikiforov defined the matrix $A_\alpha(G) = \alpha D(G) + (1-\alpha)A(G)$ for any real $\alpha\in[0,1]$. The largest eigenvalue of $A_\alpha(G)$ is…

Friedland (1981) showed that for a nonnegative square matrix A, the spectral radius r(e^D A) is a log-convex functional over the real diagonal matrices D. He showed that for fully indecomposable A, log r(e^D A) is strictly convex over D_1,…

Let $A$ be a $d\times d$ complex self-adjoint matrix, $\mathcal{X},\mathcal{Y}\subset \mathbb{C}^d$ be $k$-dimensional subspaces and let $X$ be a $d\times k$ complex matrix whose columns form an orthonormal basis of $\mathcal{X}$. We…

The eigenvalues of matrices representing the structure of large-scale complex networks present a wide range of applications, from the analysis of dynamical processes taking place in the network to spectral techniques aiming to rank the…

In this paper, it is shown that with large probability, the spectral radius of a large non-Hermitian random matrix with a general variance profile does not exceed the square root of the spectral radius of the variance profile matrix. A…

We prove a spectral upper bound for the torsion function of symmetric stable processes that holds for convex domains in $\mathbb{R}^d$. Our bound is explicit and captures the correct order of growth in $d$, improving upon the existing…

In this paper we express the eigenvalues of a sort of real heptadiagonal symmetric matrices as the zeros of explicit rational functions establishing upper and lower bounds for each of them. From these prescribed eigenvalues we compute also…

Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to map these graphs onto lower dimensional spaces and match…