On the number of maximal paths in directed last-passage percolation
classification
🧮 math.PR
keywords
directedlast-passagemaximalnumberpathspercolationexponentiallyfinitely
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.