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 excursion Groeneboom (1983) and Pitman (1983) give decompositions of Brownian motion formula_5 in terms of i.i.d Brownian excursions and the least concave majorant (or greatest convex minorant) of formula_5. For an introduction to Itô's general theory of Brownian excursions and the Itô Poisson process of excursions, see Revuz and Yor (1994), chapter XII. The Brownian excursion area arises in connection with the enumeration of connected graphs, many other problems in combinatorial theory; see e.g.,, and the limit distribution of the Betti numbers of certain varieties in cohomology theory. Takacs (1991a) shows that formula_19 has density where formula_21 are the zeros of