Philippe Marchal - Constructing a sequence of random walks strongly converging to Brownian motion

dmtcs:3335 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) - https://doi.org/10.46298/dmtcs.3335
Constructing a sequence of random walks strongly converging to Brownian motion

Authors: Philippe Marchal 1

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.

https://doi.org/10.46298/dmtcs.3335
Source: HAL:hal-01183930v1
Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Imported on: May 10, 2017
Keywords: strong convergence,simple random walk,Brownian motion,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 1309.4183
Source : ScholeXplorer IsRelatedTo DOI 10.1214/15-aop1010
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1309.4183
  • 10.1214/15-aop1010
  • 10.48550/arxiv.1309.4183
  • 1309.4183
Generalized gamma approximation with rates for urns, walks and trees

5 Documents citing this article

Share and export

Consultation statistics

This page has been seen 150 times.
This article's PDF has been downloaded 177 times.