Related papers: Scaling limit for a drainage network model
The Drainage Network is a system of coalescing random walks, exhibiting long-range dependence before coalescence, introduced by Gangopadhyay, Roy, and Sarkar. Coletti, Fontes, and Dias proved its convergence to the Brownian Web under…
We consider the tributary structure of Howard's drainage model studied by Gangopadhyay et. al. Conditional on the event that the tributary survives up to time $n$, we show that, as a sequence of random metric spaces, scaled tributary…
We introduce a system of one-dimensional coalescing nonsimple random walks with long range jumps allowing crossing paths and exibiting dependence before coalescence. We show that under diffusive scaling this system converges in distribution…
Hack [Studies of longitudinal stream profiles in Virginia and Maryland (1957). Report], while studying the drainage system in the Shenandoah valley and the adjacent mountains of Virginia, observed a power law relation $l\sim a^{0.6}$…
We consider a variant of the radial spanning tree introduced by Baccelli and Bordenave. Like the original model, our model is a tree rooted at the origin, built on the realization of a planar Poisson point process. Unlike it, the paths of…
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…
Numerous complex systems, both natural and artificial, are characterized by the presence of intertwined supply and/or drainage networks. Here we present a minimalist model of such co-evolving networks in a spatially continuous domain, where…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
We propose a metric space of coalescing pairs of paths on which we are able to prove (more or less) directly convergence of objects such as the persistence probability in the (one dimensional, nearest neighbor, symmetric) voter model or the…
We introduce a system of coalescing random paths with radialbehavior in a subsetof the plane. We call it theDiscrete Radial Poissonian Web. We show that underdiffusive scaling this family converges in distribution toa mapping of a…
Scaling laws that describe the structure of river networks are shown to follow from three simple assumptions. These assumptions are: (1) river networks are structurally self-similar, (2) single channels are self-affine, and (3) overland…
We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barab\'{a}si and Albert in the particular case of growing networks. The networks considered here evolve…
River networks serve as a paradigmatic example of all branching networks. Essential to understanding the overall structure of river networks is a knowledge of their detailed architecture. Here we show that sub-branches are distributed…
We study a system of coalescing random walks on the integer lattice $\mathbb{Z}^{d}$ in which the walk is oriented in the $d$-th direction and follows certain specified rules. We first study the geometry of the paths and show that, almost…
Several authors have studied convergence in distribution to the Brownian web under diffusive scaling of Markovian random walks. In a paper by R. Roy, K. Saha and A. Sarkar, convergence to the Brownian web is proved for a system of…
We investigate a set of directed sandpile models on the Apollonian network, which are inspired on the work by Dhar and Ramaswamy (PRL \textbf{63}, 1659 (1989)) for Euclidian lattices. They are characterized by a single parameter $q$, that…
Nowadays, scaling methods for general large-scale complex networks have been developed. We proposed a new scaling scheme called "two-site scaling". This scheme was applied iteratively to various networks, and we observed how the degree…
This article is the first in a series of three papers investigating the detailed geometry of river networks. Large-scale river networks mark an important class of two-dimensional branching networks, being not only of intrinsic interest but…
The Brownian web can be roughly described as a family of coalescing one-dimensional Brownian motions starting at all times in $\R$ and at all points of $\R$. It was introduced by Arratia; a variant was then studied by Toth and Werner;…
We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…