Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 430 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

On the joint spectral radius of nonnegative matrices (2104.13073v3)

Published 27 Apr 2021 in math.FA and math.CO

Abstract: We give an effective bound of the joint spectral radius $\rho(\Sigma)$ for a finite set $\Sigma$ of nonnegative matrices: For every $n$, [ \sqrt[n]{\left(\frac{V}{UD}\right){D} \max_C \max_{i,j\in C} \max_{A_1,\dots,A_n\in\Sigma}(A_1\dots A_n){i,j}} \le \rho(\Sigma) \le \sqrt[n]{D \max_C \max{i,j\in C} \max_{A_1,\dots,A_n\in\Sigma}(A_1\dots A_n){i,j}}, ] where $D\times D$ is the dimension of the matrices, $U,V$ are respectively the largest entry and the smallest entry over all the positive entries of the matrices in $\Sigma$, and $C$ is taken over all strongly connected components in the dependency graph. The dependency graph is a directed graph where the vertices are the dimensions and there is an edge from $i$ to $j$ if and only if $A{i,j}\ne 0$ for some matrix $A\in\Sigma$. Furthermore, a bound on the norm is also given: If $\rho(\Sigma)>0$ then there exist a nonnegative integer $r$ and two positive numbers $\alpha,\beta$ so that for every $n$, [ \alpha nr{\rho(\Sigma)}n \le \max_{A_1,\dots,A_n\in\Sigma} |A_1\dots A_n| \le \beta nr{\rho(\Sigma)}n. ] Corollaries of the approach include a simple proof for the joint spectral theorem for finite sets of nonnegative matrices and the convergence rate of some sequences. The method in use is mostly based on Fekete's lemma, for both submultiplicative and supermultiplicative sequences.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.