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 Zd (d≥2) in which weights take finitely many values is typically exponentially large.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.