activity
20052026
most citedFirst passage percolation on random graphs with finite mean degrees

66 citations · 418 across the 61 of their papers we have counts for

collaborators
Showing 2025 · math.PRShow all

5 papers · 2 filters

math.PR2025

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

math.PR2025

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…

math.PR2025★ 1 cited

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…

math.PR2025

Large Deviations for Markovian Graphon Processes and Associated Dynamical Systems on Networks

Shankar Bhamidi, Amarjit Budhiraja, Souvik Ray

We consider temporal models of rapidly evolving Markovian networks whose edge-formation and dissolution rates are determined by time-dependent spatial kernels. Equivalently, these…

math.PR2025

Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs

Shankar Bhamidi, Amarjit Budhiraja, Akshay Sakanaveeti

We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following re…