# Constructing a sequence of random walks strongly converging to Brownian motion

Abstract : 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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [7 references]

https://hal.inria.fr/hal-01183930
Contributor : Coordination Episciences Iam <>
Submitted on : Wednesday, August 12, 2015 - 9:07:25 AM
Last modification on : Thursday, July 1, 2021 - 5:32:37 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:37:37 AM

### File

dmAC0117.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01183930, version 1

### Citation

Philippe Marchal. Constructing a sequence of random walks strongly converging to Brownian motion. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.181-190. ⟨hal-01183930⟩

Record views