On the number of maximal paths in directed last-passage percolation

Abstract

We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\mathbb Z}^d$ $(d\geq2)$ in which weights take finitely many values is typically exponentially large.

15 pages, 3 figures