Convergence of a drainage network model with branching to the Brownian net
math.PR
Submitted: 2026-10-29
Updated: 2026-10-29
License: http://creativecommons.org/licenses/by/4.0/
The gist: We consider a drainage network model represented by a system of coalescing random walks exhibiting long range dependence before coalescence.
Abstract
We consider a drainage network model represented by a system of coalescing random walks exhibiting long range dependence before coalescence. This model was introduced by Gangopadhyay et. al. [GRS04] and Coletti et. al. [CFD09] proved its convergence to the Brownian web under diffusive scaling. Santos et. al. [SVZ24] considered a branching version of this model where branching occurs with low probabilities varying with the scaling parameter and showed that any sub-sequential limit contains a copy of the Brownian net. It was conjectured that the limit is indeed the Brownian net. In this work we prove this conjecture. Further, compared to [SVZ24], we explore the question of scaling limit in a wider spectrum of scaling regime. This work contributes to the broader understanding of the basin of attraction of the Brownian net.
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves
- A zero-one law for swap-invariant events in uniform spanning forests
- Bernoulli flow for Erd s-R'enyi graphs