The Brownian Web
L. R. G. Fontes, M. Isopi, C. M. Newman, K. Ravishankar
Abstract
Arratia, and later Tóth and Werner, constructed random processes that formally correspond to coalescing one-dimensional Brownian motions starting from every space-time point. We extend their work by constructing and characterizing what we call the Brownian Web as a random variable taking values in an appropriate (metric) space whose points are (compact) sets of paths. This leads to general convergence criteria and, in particular, to convergence in distribution of coalescing random walks in the scaling limit to the Brownian Web.
Create a lesson
Related papers
Sandpile avalanches in two dimensions are finite
Ahmed Bou-Rabee
Markov Chain Convergence in Kernel-Induced Geometry
Oleksii Kachaiev, Luc Brogat-Motte, Silvia Villa et al.
Interacting Stochastic Systems with Agent-Based Sampling and Connection-Based Reinforcement
Yogesh Dahiya, Gursharn Kaur, Neeraja Sahasrabudhe
Dimension-free Markov--Bernstein-type inequality for R2-valued polynomials
Egor Kosov
Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE
Akihiro Tanaka
Statistical inference for rough Burgers-type stochastic partial differential equations
Simon Chony Acosta Christian Olivera Ciprian Tudor