On the convergence of the drainage network with branching
From MaRDI portal
Publication:6401532
arXiv2206.04235MaRDI QIDQ6401532FDOQ6401532
Authors: Rafael Santos, Glauco Valle, Leonel Zuaznábar 
Publication date: 8 June 2022
Abstract: The Drainage Network is a system of coalescing random walks exhibiting long range dependence before coalescence that was introduced by Gangopadhyay, Roy and Sarkar. Coletti, Fontes and Dias proved its convergence to the Brownian Web under diffusive scaling. In this work, we introduce a perturbation of the system allowing branching of the random walks with low probabilities varying with the scaling parameter. According to the specification of the branching probabilities, we show that this drainage network with branching either converges to the Brownian Web or consists of a tight family such that any weak limit point contains a Brownian Net. In the latter case, we conjecture that the limit is indeed the Brownian Net.
This page was built for publication: On the convergence of the drainage network with branching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401532)
