Search arXivSearch

arXiv · 2012.00598

A bound on the joint spectral radius using the diagonals

Abstract

The primary aim of this paper is to establish bounds on the joint spectral radius for a finite set of nonnegative matrices based on their diagonal elements. The efficacy of this approach is evaluated in comparison to existing and related results in the field. In particular, let $Σ$ be any finite set of $D\times D$ nonnegative matrices with the largest value $U$ and the smallest value $V$ over all positive entries. For each $i=1,\dots,D$, let $m_i$ be any number so that there exist $A_1,\dots,A_{m_i}\inΣ$ satisfying $(A_1\dots A_{m_i})_{i,i} > 0$, or let $m_i=1$ if there are no such matrices. We prove that the joint spectral radius $ρ(Σ)$ is bounded by \[ \max_i \sqrt[m_i]{\max_{A_1,\dots,A_{m_i}\inΣ} (A_1\dots A_{m_i})_{i,i}} \le ρ(Σ) \le \max_i \sqrt[m_i]{\left(\frac{UD}{V}\right)^{3D^2} \max_{A_1,\dots,A_{m_i}\inΣ} (A_1\dots A_{m_i})_{i,i}}. \]

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vuong Bui. 2024-06-26. A bound on the joint spectral radius using the diagonals. https://doi.org/10.1007/s11117-024-01071-2

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO