未找到相关数据
Trees and large deviations
被引：0
作者：
Benassi, A
机构：
来源：
TREES - WORKSHOP IN VERSAILLES, JUNE 14-16, 1995
|
1996年
/
40卷
关键词：
trees;
large deviations;
entropy;
D O I：
暂无
中图分类号：
O21 [概率论与数理统计];
C8 [统计学];
学科分类号：
020208 ;
070103 ;
0714 ;
摘要：
On the vertices of a tree A we dispose real and lid random variables. We study the maximum S-n* of the sums of those variables encountered on the length n branches of A. We introduce the entropic number e(A) of A. If Lambda denotes the large deviations functions of the basic law, we show that lim sup(n-->infinity) Sn*/n less than or equal to Lambda(-1)[log(e(A))], with equality in the gaussian case.
引用
收藏
页码：135 / 140
页数：6
相关论文