Asymptotics of the Jordan Normal Form of a Random Nilpotent Matrix
- Authors: Petrov F.V.1, Sokolov V.V.2
-
Affiliations:
- St. Petersburg Department of Steklov Institute of Mathematics
- St. Petersburg State Univeristy
- Issue: Vol 224, No 2 (2017)
- Pages: 339-344
- Section: Article
- URL: https://journal-vniispk.ru/1072-3374/article/view/239577
- DOI: https://doi.org/10.1007/s10958-017-3419-z
- ID: 239577
Cite item
Abstract
We study the Jordan normal form of an upper triangular matrix constructed from a random acyclic graph or a random poset. Some limit theorems and concentration results for the number and sizes of Jordan blocks are obtained. In particular, we study a linear algebraic analog of Ulam’s longest increasing subsequence problem.
About the authors
F. V. Petrov
St. Petersburg Department of Steklov Institute of Mathematics
Author for correspondence.
Email: fedyapetrov@gmail.com
Russian Federation, St. Petersburg
V. V. Sokolov
St. Petersburg State Univeristy
Email: fedyapetrov@gmail.com
Russian Federation, St. Petersburg
Supplementary files
