66 citations · 418 across the 61 of their papers we have counts for
58 papers · 1 filter
Subcritical percolation and network archaeology on random recursive tree substrate networks
Shankar Bhamidi, Akshay Sakanaveeti
We study a network-archaeology problem for a dynamic graph whose latent substrate is a random recursive tree and whose observed topology is enriched by an independent homogeneous E…
Network evolution with self-reinforcement
Shankar Bhamidi, Remco van der Hofstad, Frank den Hollander +1
We study a new class of preferential attachment trees with \emph{self-reinforcement}. At each time, each vertex is assigned a weight equal to the cumulative sum over past times of…
The stochastic block model has the overlap graph property for modularity
Shankar Bhamidi, David Gamarnik, Remco van der Hofstad +4
The overlap gap property (OGP) is a statement about the geometry of near-optimal solutions. Exhibiting OGP implies failure of a class of local algorithms; and has been observed to…
Non-equilibrium coagulation processes and subcritical percolation on evolving networks
Sayan Banerjee, Shankar Bhamidi, Remco van der Hofstad +1
We investigate percolation on growing networks where the evolution of connected components resembles a non-equilibrium version of the multiplicative coalescent. The supercritical $…
Evolution of recursive trees with limited memory
Omer Angel, Shankar Bhamidi, Serte Donderwinkel +2
Motivated by questions in social networks, distributed computing and probabilistic combinatorics, the last few years have seen increasing interest in network evolution models where…
Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
Shankar Bhamidi, David Gamarnik, Shuyang Gong
We consider the problem of finding a dense submatrix of a matrix with i.i.d. Gaussian entries, where density is measured by average value. This problem arose from practical applica…