Related papers: A bound on the joint spectral radius using the dia…

In this paper we propose an iterative algorithm to find out the spectral radius of nonnegative tensors. This algorithm is an extension of the smoothing method for finding the largest eigenvalue of a nonnegative matrix \cite{s14}. For…

This paper studies the constrained switching (linear) system which is a discrete-time switched linear system whose switching sequences are constrained by a deterministic finite automaton. The stability of a constrained switching system is…

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor. We also apply these bounds to the adjacency spectral radius and signless Laplacian spectral radius of a uniform…

Let $\Psi _1, \ldots \Psi _m$ be bounded sets of positive kernel operators on a Banach function space $L$. We prove that for the generalized spectral radius $\rho$ and the joint spectral radius $\hat{\rho}$ the inequalities $$\rho…

We show a simple method for constructing larger matrices but preserving the spectral radius. This yields a sufficient criteria for two square matrices of arbitrary dimension have the same spectral radius, a way to compare spectral radii of…

Let $G$ be a digraph with adjacency matrix $A(G)$. Let $D(G)$ be the diagonal matrix with outdegrees of vertices of $G$. Nikiforov \cite{Niki} proposed to study the convex combinations of the adjacency matrix and diagonal matrix of the…

Let $G$ be a simple connected graph of size $m$. Let $A$ be the adjacency matrix of $G$ and let $\rho(G)$ be the spectral radius of $G$. A graph is said to be $H$-free if it does not contain a subgraph isomorphic to $H$. Let $H(\ell,3)$ be…

Recently, several research efforts showed that the analysis of joint spectral characteristics of sets of matrices is greatly eased when these matrices share an invariant cone. In this short note we prove two new results in this direction.…

Electromagnetic scattering bounds on subwavelength structures play an important role in estimating performances of antennas, RFID tags, and other wireless communication devices. An appealing approach to increase a scattering cross-section…

We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…

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…

Let $n,m$ be integers such that $1\leq m\leq (n-2)/2$ and let $[n]=\{1,\ldots,n\}$. Let $\mathcal{G}=\{G_1,\ldots,G_{m+1}\}$ be a family of graphs on the same vertex set $[n]$. In this paper, we prove that if for any $i\in [m+1]$, the…

This article presents an extended algorithm for computing the lower spectral radius of finite, non-negative matrix sets. Given a set of matrices $\mathcal{F} = \{A_1, \ldots, A_m\}$, the lower spectral radius represents the minimal growth…

Let $\lambda^{*}$ be the maximum spectral radius of connected irregular graphs on $n$ vertices with maximum degree $\Delta$. Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow…

We present some upper and lower bounds for the numerical radius of a bounded linear operator defined on complex Hilbert space, which improves on the existing upper and lower bounds. We also present an upper bound for the spectral radius of…

Consider a truncated circular unitary matrix which is a $p_n$ by $p_n$ submatrix of an $n$ by $n$ circular unitary matrix after deleting the last $n-p_n$ columns and rows. Jiang and Qi \cite{JiangQi2017} and Gui and Qi \cite{GQ2018} study…

The joint spectral radius of a finite set of real d x d matrices is defined to be the maximum possible exponential rate of growth of products of matrices drawn from that set. In previous work with K. G. Hare and J. Theys we showed that for…

We show that the joint spectral radius is pointwise H\"older continuous. In addition, the joint spectral radius is locally H\"older continuous for $\varepsilon$-inflations. In the two-dimensional case, local H\"older continuity holds on the…

Let $G$ be a graph with adjacency matrix $A(G)$, and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\alpha\in[0,1]$, write $A_\alpha(G)$ for the matrix $$A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G).$$ This paper presents…

Let $\mathcal{G}_{n, \beta^*}$ $(\mathcal{G}^*_{n,\beta^*})$ be the set of all (connected) graphs of order $n$ with fractional matching number $\beta^*$. In this paper, the graphs with maximal spectral radius in $\mathcal{G}_{n,\beta^*}$…