66 citations · 418 across the 61 of their papers we have counts for
4 papers · 2 filters
Critical first passage percolation on random graphs
Shankar Bhamidi, Rick Durrett, Xiangying Huang
In 1999, Zhang proved that, for first passage percolation on the square lattice with i.i.d. non-negative edge weights, if the probability that the passage time distr…
Network evolution with mesoscopic delay
Sayan Banerjee, Shankar Bhamidi, Partha Dey +1
Owing to the influence of real-world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these syste…
Network evolution with Macroscopic Delays: asymptotics and condensation
Sayan Banerjee, Shankar Bhamidi, Partha Dey +1
Preferential attachment models typically assume that each arriving vertex observes the current network before choosing its connection. Motivated by distributed systems and social n…
Local weak convergence and its applications
Sayan Banerjee, Shankar Bhamidi, Jianan Shen +1
Motivated in part by understanding average case analysis of fundamental algorithms in computer science, and in part by the wide array of network data available over the last decade…