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.