66 citations · 418 across the 61 of their papers we have counts for
6 papers · 2 filters
Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
Shankar Bhamidi, Sanchayan Sen
A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of…
Near Equilibrium Fluctuations for Supermarket Models with Growing Choices
Shankar Bhamidi, Amarjit Budhiraja, Miheer Dewaskar
We consider the supermarket model in the usual Markovian setting where jobs arrive at rate for some , with parallel servers each processing jobs in its queue a…
Root finding algorithms and persistence of Jordan centrality in growing random trees
Sayan Banerjee, Shankar Bhamidi
We consider models of growing random trees with model dynamics driven by an attachment function . At each stage a new…
Global lower mass-bound for critical configuration models in the heavy-tailed regime
Shankar Bhamidi, Souvik Dhara, Remco van der Hofstad +1
We establish the global lower mass-bound property for the largest connected components in the critical window for the configuration model when the degree distribution has an infini…
Persistence of hubs in growing random networks
Sayan Banerjee, Shankar Bhamidi
We consider models of evolving networks modulated by two parameters: an attachment function and a (possibly random) atta…
Community modulated recursive trees and population dependent branching processes
Shankar Bhamidi, Ruituo Fan, Nicolas Fraiman +1
We consider random recursive trees that are grown via community modulated schemes that involve random attachment or degree based attachment. The aim of this paper is to derive gene…