On the number of maximal paths in directed last-passage percolation
Annals of Probability(2018)
摘要
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.
更多查看译文
关键词
Directed last-passage percolation,maximal paths
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络