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 pseu...

Cijeli opis

Bibliografski detalji

Glavni autor:	Philippe Marchal
Format:	Artigo
Jezik:	Inglês
Izdano:	Discrete Mathematics & Theoretical Computer Science 2003-01-01
Serija:	Discrete Mathematics & Theoretical Computer Science
Teme:	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]
Online pristup:	https://dmtcs.episciences.org/3335/pdf
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!