Marking (1,2) Points of the Brownian Web and Applications
C. M. Newman (1), K. Ravishankar (2), E. Schertzer (3) ((1) Courant, Inst. of Mathematical Sciences, NYU, (2) Dept. of Mathematics, SUNY College, at New Paltz, (3) Dept. of Mathematics, Columbia Univeristy)

TL;DR
This paper explores the structure of the Brownian web and its extensions, providing new constructions for the dynamical Brownian web and the Brownian net through Poissonian marking of special points.
Contribution
It introduces a continuum structure replacing discrete arrows with parity of (1,2) points and offers complete and alternative constructions of the DyBW and BN.
Findings
Complete construction of the dynamical Brownian web.
Alternative construction of the Brownian net.
Poissonian marking of (1,2) points implements switching and branching.
Abstract
The Brownian web (BW), which developed from the work of Arratia and then T\'{o}th and Werner, is a random collection of paths (with specified starting points) in one plus one dimensional space-time that arises as the scaling limit of the discrete web (DW) of coalescing simple random walks. Two recently introduced extensions of the BW, the Brownian net (BN) constructed by Sun and Swart, and the dynamical Brownian web (DyBW) proposed by Howitt and Warren, are (or should be) scaling limits of corresponding discrete extensions of the DW -- the discrete net (DN) and the dynamical discrete web (DyDW). These discrete extensions have a natural geometric structure in which the underlying Bernoulli left or right "arrow" structure of the DW is extended by means of branching (i.e., allowing left and right simultaneously) to construct the DN or by means of switching (i.e., from left to right and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Mathematical Dynamics and Fractals · Algorithms and Data Compression
