Constructing a sequence of random walks strongly converging to Brownian motion
暂无分享,去创建一个
We give an algorithm which constructs recursively a sequence of simple random walks on $\mathbb{Z}$ converging almost surely to a Brownian motion. One obtains by the same method conditional versions of the simple random walk converging to the excursion, the bridge, the meander or the normalized pseudobridge.
[1] Jean-Luc Rémy,et al. Un Procédé Itératif de Dénombrement D'arbres Binaires et Son Application A Leur Génération Aléatoire , 1985, RAIRO Theor. Informatics Appl..
[2] P. Major,et al. An approximation of partial sums of independent RV'-s, and the sample DF. I , 1975 .
[3] J. Pitman,et al. The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator , 1997 .