Approximation of subadditive functions and convergence rates in limiting-shape results

被引:0
|
作者
Alexander, KS [1 ]
机构
[1] Univ So Calif, Dept Math DRB 155, Los Angeles, CA 90089 USA
来源
ANNALS OF PROBABILITY | 1997年 / 25卷 / 01期
关键词
subadditivity; first-pasage percolation; longest common subsequence; oriented first-passage percolation; connectivity function;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
For a nonnegative subadditive function h on Z(d), with limiting approximation g(x) = lim(n) h(nx)/n, it is of interest to obtain bounds on the discrepancy between g(x) and h(x), typically of order \x\(nu) with nu < 1. For certain subadditive h(x), particularly those which are expectations associated with optimal random paths from 0 to x, in a somewhat standardized way a more natural and seemingly weaker property can be established: every x is in a bounded multiple of the convex hull of the set of sites satisfying a similar bound. me show that this convex-hull property implies the desired bound for all x. Applications include rates of convergence in limiting-shape results for first-passage percolation (standard and oriented) and longest common subsequences and bounds on the error in the exponential-decay approximation to the off-axis connectivity function for subcritical Bernoulli bond percolation on the integer lattice.
引用
收藏
页码:30 / 55
页数:26
相关论文
共 50 条