Brownian web paths from a random space time point. The introduction of this topology allowed them to prove the convergence of the coalescing random walks to a unique limiting object and characterize it. They named this limiting object Brownian web. An extension of the Brownian web, called the Brownian net, has been introduced by Sun and Swart by allowing the coalescing Brownian motions to undergo branching. An alternative construction of the Brownian net was given by Newman, Ravishankar and Schertzer. For a recent survey, see Schertzer, Sun and Swart. Brownian web In probability theory, the Brownian web is an uncountable collection of
Brownian meander Brownian meander In the mathematical theory of probability, Brownian meander formula_1 is a continuous non-homogeneous Markov process defined as follows: Let formula_2 be a standard one-dimensional Brownian motion, and formula_3, i.e. the last time before "t" = 1 when formula_4 visits formula_5. Then the Brownian meander is defined by the following: In words, let formula_7 be the last time before 1 that a standard Brownian motion visits formula_5. (formula_9 almost surely.) We snip off and discard the trajectory of Brownian motion before formula_7, and scale the remaining part so that it spans a time interval of length 1. The scaling