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 motion "x", 1 ≤ "i" ≤ "m", is given by ½Δ, where Δ is the Laplace–Beltrami operator given in local coordinates by where ["g"] = ["g"] in the sense of the inverse of a square matrix. The narrow escape problem is a ubiquitous problem in biology, biophysics and cellular biology which has the following formulation: a Brownian particle (ion, molecule, or protein) is confined to a bounded domain (a compartment or a cell) by a reflecting boundary, except for a small window through which it can escape. The narrow escape problem is that of calculating the mean escape time. This time