Convergence of coalescing nonsimple random walks to the Brownian web

DOI10.1214/EJP.V10-235zbMATH Open1067.60099arXivmath/0501141OpenAlexW2133273538MaRDI QIDQ1767549FDOQ1767549

Authors: Charles M. Newman, Rongfeng Sun, Krishnamurthi Ravishankar 

Publication date: 8 March 2005

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: The Brownian Web (BW) is a family of coalescing Brownian motions starting from every point in space and time $RimesR$. It was first introduced by Arratia, and later analyzed in detail by T'{o}th and Werner. More recently, Fontes, Isopi, Newman and Ravishankar gave a characterization of the BW, and general convergence criteria allowing either crossing or noncrossing paths, which they verified for coalescing simple random walks. Later Ferrari, Fontes, and Wu verified these criteria for a two dimensional Poisson Tree. In both cases, the paths are noncrossing. In this thesis, we formulate new convergence criteria for crossing paths, and verify them for non-simple coalescing random walks (both discrete and continuous time) satisfying a finite fifth moment condition. This is the first time convergence to the BW has been proved for models with crossing paths. Several corollaries are presented, including an analysis of the scaling limit of voter model interfaces that extends a result of Cox and Durrett.

Full work available at URL: https://arxiv.org/abs/math/0501141

Recommendations

• The Brownian Web
• Convergence to the Brownian web for a generalization of the drainage network model
• The Brownian web: characterization and convergence
• A stronger topology for the Brownian web
• Entrance laws for annihilating Brownian motions and the continuous-space voter model
• A version of the random directed forest and its convergence to the Brownian web
• Brownian net with killing
• The Brownian net
• Super-Brownian limits of voter model clusters
• The Brownian Web as a random \(\mathbb{R} \)-tree

zbMATH Keywords

scaling limitsannihilating Brownian motionsBrownian networkscrossing pathsnon-simple random walks

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Brownian motion (60J65) Interacting particle systems in time-dependent statistical mechanics (82C22)

Cited In (26)

• Coalescing Brownian flows: a new approach
• Two directed non-planar random networks and their scaling limits
• The Brownian Web
• THE FULL BROWNIAN WEB AS SCALING LIMIT OF STOCHASTIC FLOWS
• Marking \((1, 2)\) points of the Brownian web and applications
• An invariance principle for biased voter model interfaces
• Dynamics for the Brownian web and the erosion flow
• Equilibrium interfaces of biased voter models
• Directed, cylindric and radial Brownian webs
• Scaling limit for a family of coalescing radial random paths absorbed at the origin
• Hack's law in a drainage network model: a Brownian web approach
• Convergence to the Brownian web for a generalization of the drainage network model
• A stronger topology for the Brownian web
• Collision times of random walks and applications to the Brownian web
• Coarsening, nucleation, and the marked Brownian web
• Scaling limit for a drainage network model
• The Brownian web: characterization and convergence
• A version of the random directed forest and its convergence to the Brownian web
• Coalescing directed random walks on the backbone of a \(1+1\)-dimensional oriented percolation cluster converge to the Brownian web
• Slow-to-start traffic model: traffic saturation and scaling limits
• Convergence of random walks with Markovian cookie stacks to Brownian motion perturbed at extrema
• The Brownian net
• Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
• Perturbations of supercritical oriented percolation and sticky Brownian webs
• A construction of the stable web
• The 2D-directed spanning forest converges to the Brownian web

This page was built for publication: Convergence of coalescing nonsimple random walks to the Brownian web

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767549)