Anish Sarkar

Scaling limit of a drainage network model on a perturbed lattice

Abstract The study of random networks generally requires that vertices be independently and uniformly distributed over disjoint regions such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a drai...

Learning models on rooted regular trees with majority update policy: Convergence and phase transition

Abstract We study a model of social learning on rooted regular trees. An agent is stationed at each vertex of double struck upper T Subscript m <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.ca...