arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.0731math.PR
收藏

条件极限分布下的长游程

Long runs under a conditional limit distribution

Michel Broniatowski, Virgile Caron

摘要:

本文给出了随机游动的长游程的密度的一个精确逼近,其条件是它的终值或它的被和函数的平均值,当它们的个数趋于无穷大时。在条件事件的大偏差范围内,它扩展了吉布斯条件原理,在这个意义上,它提供了一个描述的分布的随机游动的长时间序列。当条件事件表明随机游动的终值属于一个非空内部的薄集或厚集时,也得到了游程密度的近似值。这些近似在随机游动的条件分布下的概率中成立,或者在测量之间的全变差范数中成立。通过重要性抽样的近似计划的罕见事件概率的评估的应用程序。当条件事件在中心极限定理的范围内时,它为统计推断提供了一种工具,因为它产生了一种有效的方法来实现Rao-Blackwell定理以改进估计量;它还导致了具有冗余参数的模型中的条件推断过程。这种长期运行的模拟算法,连同一个算法确定的最大长度的近似是有效的,以规定的精度。

英文摘要:

This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to infinity. In the large deviation range of the conditioning event it extends the Gibbs conditional principle in the sense that it provides a description of the distribution of the random walk on long subsequences. An approximation of the density of the runs is also obtained when the conditioning event states that the end value of the random walk belongs to a thin or a thick set with a nonempty interior. The approximations hold either in probability under the conditional distribution of the random walk, or in total variation norm between measures. An application of the approximation scheme to the evaluation of rare event probabilities through importance sampling is provided. When the conditioning event is in the range of the central limit theorem, it provides a tool for statistical inference in the sense that it produces an effective way to implement the Rao-Blackwell theorem for the improvement of estimators; it also leads to conditional inference procedures in models with nuisance parameters. An algorithm for the simulation of such long runs is presented, together with an algorithm determining the maximal length for which the approximation is valid up to a prescribed accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑