The stability of large random matrices and their products (Q796193): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Thomas Kaijser / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Thomas Kaijser / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1214/aop/1176993291 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035559558 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 21:04, 19 March 2024

scientific article
Language Label Description Also known as
English
The stability of large random matrices and their products
scientific article

    Statements

    The stability of large random matrices and their products (English)
    0 references
    0 references
    0 references
    1984
    0 references
    For fixed n, let \(\{\) A(1),A(2),...\(\}\) be an infinite sequence of random independent identically distributed (i.i.d.) real \(n\times n\) matrices. Let x(0) be a non-zero vector in \({\mathbb{R}}^ n\) and define \(x(t)=A(t)A(t- 1)...A(1)x(0)\) for \(t=1,2,..\).. Define \(\lambda\) (x(0)) by \(\lambda(x(0))=\lim_{t\to \infty}\| x(t)\|^{1/t}\) whenever the limit exists almost surely and is non-random. (Due to work by \textit{H. Furstenberg}, Trans. Am. Math. Soc. 108, 377-428 (1963; Zbl 0203.191) and others it can be shown that in many situations this is the case.) Whenever \(\lambda\) (x(0)) exists for all x(0))\(\neq 0\) one can define \({\bar \lambda}\) and \({\underline \lambda}\) by \({\bar \lambda}=\sup \{\lambda(x(0)):x(0)\neq 0\}\) and \({\underline \lambda}=\inf \{\lambda(x(0)):x(0)\neq 0\}\). (Very often the situation is in fact such that \({\bar \lambda}={\underline \lambda}.)\) For a fixed n, the system \(\{A(t),t=1,2,...\}\) is called strongly stable if \({\bar \lambda}<1\) and strongly unstable if \({\underline \lambda}>1\). As n tends to infinity the sequence of systems is called asymptotically strongly stable (resp. unstable) if there exists an integer N such that strong stability (resp. instability) is valid for each \(n>N.\) The purpose of this paper is threefold. In the first part the authors present a case when \({\bar \lambda}={\underline \lambda}\) and when this quantity can be determined explicitly. The case considered is the case when the elements of A(1) are i.i.d. standard symmetric random variables with exponent \(\alpha (0<\alpha \leq 2)\). The authors also give precise conditions when a sequence of systems of random matrices of this type is asymptotically strongly stable (resp. unstable). In the second part the authors first give a general upper bound for \({\bar \lambda}\) and then also a lower bound for \({\underline \lambda}\) in a fairly general situation. To obtain this latter bound quite a few sharp estimates are needed. The authors then use these bounds when determining criteria for asymptotic strong stability (resp. unstability). In the third part of the paper the authors construct counter-examples to claims by \textit{R. M. May} [Will a large complex system be stable? Nature 238, 413-414 (1972)] and \textit{H. M. Hastings} [The May-Wigner stability theorem. J. Theor. Biol. 97, 155-166 (1982)] concerning asymptotic strong stability resp. unstability.
    0 references
    products of random matrices
    0 references
    normal random matrices
    0 references
    stability of ecosystems
    0 references
    strongly stable
    0 references
    strongly unstable
    0 references
    asymptotically strongly stable
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references