Brownian web is what we now call the Brownian web. Formally speaking, it is a collection of one-dimensional coalescing Brownian motions starting from every space-time point in formula_1. The fact that the Brownian web consists of an "uncountable" number of Brownian motions is what makes the construction highly non-trivial. Arratia gave a construction but was unable to prove convergence of coalescing random walks to a limiting object and characterize such a limiting object. Tóth and Werner in their study of the true self-repelling motion obtained many detailed properties of this limiting object and its dual but did not prove convergence of coalescing
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