48 citations · 174 across the 18 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.PR2017★ 5 cited
A probabilistic approach to the leader problem in random graphs
Louigi Addario-Berry, Shankar Bhamidi, Sanchayan Sen
We study the fixation time of the identity of the leader, i.e., the most massive component, in the general setting of Aldous's multiplicative coalescent [4, 5], which in an asympto…
math.PR2017★ 27 cited
Universality for critical heavy-tailed network models: Metric structure of maximal components
Shankar Bhamidi, Souvik Dhara, Remco van der Hofstad +1
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed…