activity
20042023
most citedRandom oriented Trees: a Model of drainage networks

28 citations · 56 across the 10 of their papers we have counts for

collaborators

10 papers

math.PR2023

Scaling limit of a drainage network model on perturbed lattice

Rahul Roy, Kumarjit Saha, Anish Sarkar

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 p…

math.PR2018

The 2d-directed spanning forest converges to the Brownian web

David Coupier, Kumarjit Saha, Anish Sarkar +1

The two-dimensional directed spanning forest (DSF) introduced by Baccelli and Bordenave is a planar directed forest whose vertex set is given by a homogeneous Poisson point process…

math.PR2015

Collision times of random walks and applications to the Brownian web

David Coupier, Kumarjit Saha, Anish Sarkar +1

Convergence of directed forests, spanning on random subsets of lattices or on point processes, towards the Brownian web has made the subject of an abundant literature, a large part…

math.PR2015★ 12 cited

Hack's law in a drainage network model: A Brownian web approach

Rahul Roy, Kumarjit Saha, Anish Sarkar

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 Vi…

math.PR2013★ 2 cited

Random directed forest and the Brownian web

Rahul Roy, Kumarjit Saha, Anish Sarkar

Consider the dimensional lattice where each vertex is open or closed with probability or respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \m…

math.PR2011★ 3 cited

Brownian Web and Oriented Percolation: Density Bounds

Anish Sarkar, Rongfeng Sun

In a recent work, we proved that under diffusive scaling, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time la…