66 citations · 418 across the 61 of their papers we have counts for
3 papers · 2 filters
Degree distribution of shortest path trees and bias of network sampling algorithms
Shankar Bhamidi, Jesse Goodman, Remco van der Hofstad +1
In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determi…
Diameter of the stochastic mean-field model of distance
Shankar Bhamidi, Remco van der Hofstad
We consider the complete graph $\cK_n$ on vertices with exponential mean edge lengths. Writing for the weight of the smallest-weight path between vertex $i,j\in [n…
The importance sampling technique for understanding rare events in Erdős-Rényi random graphs
Shankar Bhamidi, Jan Hannig, Chia Ying Lee +1
In dense Erdős-Rényi random graphs, we are interested in the events where large numbers of a given subgraph occur. The mean behavior of subgraph counts is known, and only recently…