Scaling limit of a drainage network model on perturbed lattice

Abstract

Study of random networks generally requires the nodes to be independently and uniformly distributed such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a drainage network model constructed on a randomly perturbed subset of $\mathbb{Z}^2$, where both horizontal and vertical perturbations are given by exponentially decaying unbounded discrete random variables and vertical perturbations are allowed in the upward direction only. We show that the resultant stochastic network is a single tree a.s. We further establish that as a collection of paths, under diffusive scaling the resultant network converges to the Brownian web.