A max version of the generalized spectral radius theorem

Let Ψ be a bounded set of n × n nonnegative matrices in max algebra. In this paper we propose the notions of the max algebra version of the generalized spectral radius μ(Ψ) of Ψ, and the max algebra version of the joint spectral radius η(Ψ) of Ψ. The max algebra version of the generalized spectral radius theorem μ(Ψ) = η(Ψ) is established. We propose the relationship between the generalized spectral radius ρ(Ψ) of Ψ (in the sense of Daubechies and Lagarias) and its max algebra version μ(Ψ). Moreover, a generalization of Elsner and van den Driessche’s lemma is presented as well.     

On the continuity of the generalized spectral radius in max algebra

Given a bounded set Ψ of n×n non-negative matrices, let ρ(Ψ) and μ(Ψ) denote the generalized spectral radius of Ψ and its max version, respectively. We show that

     

Preservers of spectral radius, numerical radius, or spectral norm of the sum on nonnegative matrices

Let be the set of entrywise nonnegative n×n matrices. Denote by r(A) the spectral radius (Perron root) of . Characterization is obtained for maps such that r(f(A)+f(B))=r(A+B) for all . In particular, it is shown that such a map has the form

     

An explicit Lipschitz constant for the joint spectral radius

In 2002, 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 obtained.     

Generalized joint spectral radius and stability of switching systems

This paper extends the notion of generalized joint spectral radius with exponents, originally defined for a finite set of matrices, to probability distributions. We show that, under a certain invariance condition, the radius is calculated as the spectral radius of a matrix that can be easily computed, extending the classical counterpart. Using this result we investigate the mean stability of switching systems. In particular we establish the equivalence of mean square stability, simultaneous contractibility in square mean, and the existence of a quadratic Lyapunov function. Also the stabilization of positive switching systems is studied. Numerical examples are given to illustrate the results.     

On the spectral radius and the spectral norm of Hadamard products of nonnegative matrices

We prove the spectral radius inequality ρ(A₁°A₂°?°A_k)?ρ(A₁A₂?A_k) for nonnegative matrices using the ideas of Horn and Zhang. We obtain the inequality ‖A°B‖?ρ(A^TB) for nonnegative matrices, which improves Schur’s classical inequality ‖A°B‖?‖A‖‖B‖, where ‖·‖ denotes the spectral norm. We also give counterexamples to two conjectures about the Hadamard product.     

On the signless Laplacian spectral radius of graphs with cut vertices

In this paper, we show that among all the connected graphs with n vertices and k cut vertices, the maximal signless Laplacian spectral radius is attained uniquely at the graph G_n,k, where G_n,k is obtained from the complete graph K_n-k by attaching paths of almost equal lengths to all vertices of K_n-k. We also give a new proof of the analogous result for the spectral radius of the connected graphs with n vertices and k cut vertices (see [A. Berman, X.-D. Zhang, On the spectral radius of graphs with cut vertices, J. Combin. Theory Ser. B 83 (2001) 233-240]). Finally, we discuss the limit point of the maximal signless Laplacian spectral radius.     

Isometries of a generalized numerical radius

For 0<q<1, the q-numerical range is defined on the algebra M_n of all n×n complex matrices by

W_q(A)={x^∗Ay:x,y∈Cⁿ,∥x∥=∥y∥=1,〈y,x〉=q}.     

Some lower bounds for the spectral radius of matrices using traces

Let A be an n×n matrix with eigenvalues λ₁,λ₂,…,λ_n, and let m be an integer satisfying rank(A)?m?n. If A is real, the best possible lower bound for its spectral radius in terms of m, trA and trA² is obtained. If A is any complex matrix, two lower bounds for are compared, and furthermore a new lower bound for the spectral radius is given only in terms of trA,trA²,‖A‖,‖A^∗A-AA^∗‖,n and m.     

Schur product of matrices and numerical radius (range) preserving maps

Let F(A) be the numerical range or the numerical radius of a square matrix A. Denote by A ° B the Schur product of two matrices A and B. Characterizations are given for mappings on square matrices satisfying F(A ° B) = F(?(A) ° ?(B)) for all matrices A and B. Analogous results are obtained for mappings on Hermitian matrices.     

Graphs with maximal signless Laplacian spectral radius

By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G),D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. It is known that connected graphs G that maximize the signless Laplacian spectral radius ρ(Q(G)) over all connected graphs with given numbers of vertices and edges are (degree) maximal. For a maximal graph G with n vertices and r distinct vertex degrees δ_r>δ_r-1>?>δ₁, it is proved that ρ(Q(G))<ρ(Q(H)) for some maximal graph H with n+1 (respectively, n) vertices and the same number of edges as G if either G has precisely two dominating vertices or there exists an integer such that δ_i+δ_r+1-i?n+1 (respectively, δ_i+δ_r+1-i?δ_l+δ_r-l+1). Graphs that maximize ρ(Q(G)) over the class of graphs with m edges and m-k vertices, for k=0,1,2,3, are completely determined.     

The Laplacian spectral radius of some bipartite graphs

In this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n vertices and k cut edges and the bicyclic bipartite graphs, respectively. Identifying the center of a star K_1,k and one vertex of degree n of K_m,n, we denote by the resulting graph. We show that the graph (1?k?n-4) is the unique graph with the largest Laplacian spectral radius among the bipartite graphs with n vertices and k cut edges, and (n?7) is the unique graph with the largest Laplacian spectral radius among all the bicyclic bipartite graphs.     

Sharp bounds on the spectral radius of a nonnegative matrix

We give upper and lower bounds for the spectral radius of a nonnegative matrix using its row sums and characterize the equality cases if the matrix is irreducible. Then we apply these bounds to various matrices associated with a graph, including the adjacency matrix, the signless Laplacian matrix, the distance matrix, the distance signless Laplacian matrix, and the reciprocal distance matrix. Some known results in the literature are generalized and improved.     

New upper bounds on the spectral radius of unicyclic graphs

Let G=(V(G),E(G)) be a unicyclic simple undirected graph with largest vertex degree Δ. Let C_r be the unique cycle of G. The graph G-E(C_r) is a forest of r rooted trees T₁,T₂,…,T_r with root vertices v₁,v₂,…,v_r, respectively. Let

     

The case of equality in the Dobrushin-Deutsch-Zenger bound

Suppose that A=(a_i,j) is an n×n real matrix with constant row sums μ. Then the Dobrushin-Deutsch-Zenger (DDZ) bound on the eigenvalues of A other than μ is given by . When A a transition matrix of a finite homogeneous Markov chain so that μ=1,Z(A) is called the coefficient of ergodicity of the chain as it bounds the asymptotic rate of convergence, namely, , of the iteration , to the stationary distribution vector of the chain.In this paper we study the structure of real matrices for which the DDZ bound is sharp. We apply our results to the study of the class of graphs for which the transition matrix arising from a random walk on the graph attains the bound. We also characterize the eigenvalues λ of A for which |λ|=Z(A) for some stochastic matrix A.     

New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree

This paper studies the problem of estimating the spectral radius of trees with the given number of vertices and maximum degree. We obtain the new upper bounds on the spectral radius of the trees, and the results are the best upper bounds expressed by the number of vertices and maximum degree, at present.     

The limit of the spectral radius of block Toeplitz matrices with nonnegative entries

A bi-infinite sequence ...,t _–2,t _–1,t ₀,t ₁,t ₂,... of nonnegativep×p matrices defines a sequence of block Toeplitz matricesT _n =(t _ik ),n=1,2,...,, wheret _ik =t _k–i ,i,k=1,...,n. Under certain irreducibility assumptions, we show that the limit of the spectral radius ofT _n , asn tends to infinity, is given by inf{()[0,]}, where () is the spectral radius of _jz t _j ^j .Supported by SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld     

On the number of P-vertices of some graphs

We provide positive answers to some open questions presented recently by Kim and Shader on a continuity-like property of the P-vertices of nonsingular matrices whose graph is a path. A criterion for matrices associated with more general trees to have at most n − 1 P-vertices is established. The cases of the cycles and stars are also analyzed. Several algorithms for generating matrices with a given number of P-vertices are proposed.     

Distance spectral radius of trees with fixed number of pendent vertices

The distance spectral radius ρ(G)$\rho (G)$ of a graph G   is the largest eigenvalue of the distance matrix D(G)$D(G)$. In this paper, we characterize the graph with minimum distance spectral radius among trees with fixed number of pendent vertices.     

The normed finiteness property of compact contraction operators

We study the joint spectral radius given by a finite set of compact operators on a Hilbert space. It is shown that the normed finiteness property holds in this case, that is, if all the compact operators are contractions and the joint spectral radius is equal to 1 then there exists a finite product that has a spectral radius equal to 1. We prove an additional statement in that the requirement that the joint spectral radius be equal to 1 can be relaxed to the asking that the maximum norm of finite products of a length norm is equal to 1. The length of this product is related to the dimension of the subspace on which the set of operators is norm preserving.