Mixing time of exponential random graphs S Bhamidi, G Bresler, A Sly 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 803-812, 2008 | 206 | 2008 |
Scaling limits for critical inhomogeneous random graphs with finite third moments S Bhamidi, R Van Der Hofstad, J van Leeuwaarden | 106 | 2010 |
First passage percolation on random graphs with finite mean degrees S Bhamidi, R Van Der Hofstad, G Hooghiemstra | 102 | 2010 |
Novel scaling limits for critical inhomogeneous random graphs S Bhamidi, R van Der Hofstad, JSH Van Leeuwaarden | 98 | 2012 |
Community extraction in multilayer networks with heterogeneous community structure JD Wilson, J Palowitch, S Bhamidi, AB Nobel Journal of Machine Learning Research 18 (149), 1-49, 2017 | 75 | 2017 |
First passage percolation on the Erdős–Rényi random graph S Bhamidi, R Van der Hofstad, G Hooghiemstra Combinatorics, Probability and Computing 20 (5), 683-707, 2011 | 73 | 2011 |
Universality for first passage percolation on sparse random graphs S Bhamidi, R van der Hofstad, G Hooghiemstra | 64 | 2017 |
A testing based extraction algorithm for identifying significant communities in networks JD Wilson, S Wang, PJ Mucha, S Bhamidi, AB Nobel | 63 | 2014 |
Stochastic weighted graphs: Flexible model specification and simulation JD Wilson, MJ Denny, S Bhamidi, SJ Cranmer, BA Desmarais Social Networks 49, 37-47, 2017 | 59 | 2017 |
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs S Bhamidi, R van der Hofstad, S Sen Probability Theory and Related Fields 170, 387-474, 2018 | 57 | 2018 |
Universal techniques to analyze preferential attachment trees: Global and local analysis S Bhamidi preparation. Version August 19, 2007 | 54 | 2007 |
Continuum limit of critical inhomogeneous random graphs S Bhamidi, S Sen, X Wang Probability Theory and Related Fields 169, 565-641, 2017 | 50 | 2017 |
Weakly interacting particle systems on inhomogeneous random graphs S Bhamidi, A Budhiraja, R Wu Stochastic Processes and their Applications 129 (6), 2174-2206, 2019 | 48 | 2019 |
Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erd\H {o} sR\'enyi random graph S Bhamidi, N Broutin, S Sen, X Wang arXiv preprint arXiv:1411.3417, 2014 | 48 | 2014 |
Twitter event networks and the superstar model S Bhamidi, JM Steele, T Zaman The Annals of Applied Probability 25 (5), 2462-2502, 2015 | 46 | 2015 |
The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs S Bhamidi, A Budhiraja, X Wang Probability Theory and Related Fields 160 (3), 733-796, 2014 | 46 | 2014 |
Spectra of large random trees S Bhamidi, SN Evans, A Sen Journal of Theoretical Probability 25 (3), 613-654, 2012 | 45 | 2012 |
Weak disorder asymptotics in the stochastic mean-field model of distance S Bhamidi, R Van Der Hofstad | 38 | 2012 |
Survival and extinction of epidemics on random graphs with general degree S Bhamidi, D Nam, O Nguyen, A Sly | 37 | 2021 |
Significance-based community detection in weighted networks J Palowitch, S Bhamidi, AB Nobel Journal of Machine Learning Research 18 (188), 1-48, 2018 | 34 | 2018 |